<?xml version="1.0" encoding="UTF-8" standalone="yes"?><add><doc><field name="objectKind">mycoreobject</field><field name="id">rosdok_document_0000028042</field><field name="returnId">rosdok_document_0000028042</field><field name="objectProject">rosdok</field><field name="objectType">document</field><field name="link">rosdok_derivate_0000229943</field><field name="modified">2026-10-23T08:51:01.434Z</field><field name="created">2026-10-22T14:02:36.728Z</field><field name="modifiedby">editorKE</field><field name="createdby">editorKE</field><field name="state">published</field><field name="derCount">1</field><field name="derivates">rosdok_derivate_0000229943</field><field name="worldReadable">true</field><field name="worldReadableComplete">true</field><field name="category">derivate_types:fulltext</field><field name="allMeta">Volltext</field><field name="allMeta">fulltext</field><field name="allMeta">wf_edit_epub wf_register_epub</field><field name="category">state:published</field><field name="category.top">state:published</field><field name="allMeta">veröffentlicht</field><field name="allMeta">published</field><field name="allMeta">rosdok_id00005906</field><field name="allMeta">1987387872</field><field name="allMeta">Oau</field><field name="allMeta">2026-10-22</field><field name="allMeta">2026-10-23T08:51:00Z</field><field name="allMeta">rda</field><field name="allMeta">Converted from PICA to MODS using Pica2MODS XSLT Transformer 2.14-SNAPSHOT [SCM: "" "" ""] with mode 'DEFAULT'.</field><field name="allMeta">Workingpaper</field><field name="allMeta">An</field><field name="allMeta">algorithm for optimal multileaf collimator field segmentation with interleaf collision constraint 2</field><field name="allMeta">Multileaf collimators are widely used in radiotherapy to realize intensity modulated fields as superpositions of homogeneous fields, so called segments. One important step in the planning process is the decomposition of the modulated field into a small number of segments such that the total number of monitor units is also small. In this paper we present an algorithm that is based on the results of [6] and constructs a segmentation with minimal total number of monitor units and a small number of segments, taking into account a machine–dependent constraint, that forbids leaf overtravel in adjacent rows of the multileaf collimator.</field><field name="allMeta">Thomas</field><field name="allMeta">Kalinowski</field><field name="allMeta">VerfasserIn</field><field name="allMeta">aut</field><field name="allMeta">https://purl.uni-rostock.de/rosdok/id00005906</field><field name="allMeta">urn:nbn:de:gbv:28-rosdok_id00005906-8</field><field name="allMeta">10.18453/rosdok_id00005906</field><field name="allMeta">510 Mathematik</field><field name="allMeta">Mathematisch-Naturwissenschaftliche Fakultät</field><field name="allMeta">alle Rechte vorbehalten</field><field name="allMeta">Rechteinhaber Universität Rostock</field><field name="allMeta">frei zugänglich (Open Access)</field><field name="allMeta">Lizenz Metadaten: CC0</field><field name="allMeta">en</field><field name="allMeta">1 Online-Ressource (10 Seiten)</field><field name="allMeta">2003</field><field name="allMeta">University of Rostock, Institute of Mathematics</field><field name="allMeta">Rostock</field><field name="allMeta">monographic</field><field name="allMeta">2003</field><field name="allMeta">2026</field><field name="allMeta">Universitätsbibliothek Rostock</field><field name="allMeta">Rostock</field><field name="allMeta">2026</field><field name="allMeta">Universitätsbibliothek Rostock</field><field name="allMeta">https://purl.uni-rostock.de/rosdok/id00005906</field><field name="allMeta">Thomas Kalinowski</field><field name="allMeta">rosdok_id00005816</field><field name="allMeta">1986139832</field><field name="allMeta">Odv</field><field name="allMeta">https://purl.uni-rostock.de/rosdok/id00005816</field><field name="allMeta">Preprints aus dem Institut für Mathematik</field><field name="allMeta">3255797-8</field><field name="allMeta">03/8</field><field name="allMeta">0003-0008</field><field name="category">doctype:epub</field><field name="category.top">doctype:epub</field><field name="allMeta">Dokumenttyp</field><field name="allMeta">Document type</field><field name="category">doctype:epub.workingpaper</field><field name="category.top">doctype:epub.workingpaper</field><field name="allMeta">Workingpaper</field><field name="allMeta">working paper</field><field name="allMeta">diniPublType:workingPaper diniPublType2022:WorkingPaper</field><field name="allMeta">info:eu-repo/semantics/workingPaper</field><field name="allMeta">document</field><field name="category">diniPublType2022:WorkingPaper</field><field name="category.top">diniPublType2022:WorkingPaper</field><field name="allMeta">Arbeitspapier</field><field name="allMeta">Working paper</field><field name="allMeta">KDSF (Pu37)</field><field name="category">SDNB:510</field><field name="category.top">SDNB:510</field><field name="allMeta">510 Mathematik</field><field name="allMeta">510 Mathematics</field><field name="category">institution:unirostock</field><field name="category.top">institution:unirostock</field><field name="allMeta">Universität Rostock</field><field name="allMeta">University of Rostock</field><field name="allMeta">Universität Rostock</field><field name="allMeta">Universität Rostock</field><field name="allMeta">Uni.Rostock</field><field name="allMeta">http://d-nb.info/gnd/38329-6</field><field name="category">institution:unirostock.mnf</field><field name="category.top">institution:unirostock.mnf</field><field name="allMeta">Mathematisch-Naturwissenschaftliche Fakultät</field><field name="allMeta">Faculty of Mathematics and Natural Sciences</field><field name="allMeta">Universität Rostock. Mathematisch-Naturwissenschaftliche Fakultät</field><field name="allMeta">Mathematisch-Natur-&lt;br /&gt;wissenschaftliche Fakultät</field><field name="allMeta">Uni.Rostock.Fakultaet.MNF</field><field name="allMeta">http://d-nb.info/gnd/2147083-2</field><field name="category">licenseinfo:work</field><field name="category.top">licenseinfo:work</field><field name="allMeta">Werk</field><field name="allMeta">work</field><field name="category">licenseinfo:work.rightsreserved</field><field name="category.top">licenseinfo:work.rightsreserved</field><field name="allMeta">alle Rechte vorbehalten</field><field name="allMeta">all rights reserved</field><field name="allMeta">/creativecommons/r/reserved/0.9/88x31.png</field><field name="allMeta">[DE-28]Urheberrechtsschutz 1.0$gRights Statements$uhttp://rightsstatements.org/vocab/InC/1.0/</field><field name="allMeta">http://rightsstatements.org/vocab/InC/1.0/</field><field name="allMeta">http://rightsstatements.org/vocab/InC/1.0/</field><field name="category">licenseinfo:deposit</field><field name="category.top">licenseinfo:deposit</field><field name="allMeta">Veröffentlichungsgenehmigung</field><field name="allMeta">permission to store</field><field name="category">licenseinfo:deposit.rightsunirostock</field><field name="category.top">licenseinfo:deposit.rightsunirostock</field><field name="allMeta">Rechteinhaber Universität Rostock</field><field name="allMeta">rightsholder Rostock University</field><field name="category">accesscondition:openaccess</field><field name="category.top">accesscondition:openaccess</field><field name="allMeta">frei zugänglich (Open Access)</field><field name="allMeta">open access</field><field name="allMeta">http://purl.org/coar/access_right/c_abf2</field><field name="allMeta">OA</field><field name="allMeta">free</field><field name="allMeta">info:eu-repo/semantics/openAccess</field><field name="allMeta">[DE-28]Open Access$gControlled Vocabulary for Access Rights$uhttp://purl.org/coar/access_right/c_abf2</field><field name="category">licenseinfo:metadata</field><field name="category.top">licenseinfo:metadata</field><field name="allMeta">Lizenzen für Metadaten</field><field name="category">licenseinfo:metadata.cc0</field><field name="category.top">licenseinfo:metadata.cc0</field><field name="allMeta">Lizenz Metadaten: CC0</field><field name="allMeta">license metadata: CC0</field><field name="allMeta">/creativecommons/p/zero/1.0/88x31.png</field><field name="allMeta">https://creativecommons.org/publicdomain/zero/1.0/</field><field name="category">rfc5646:en</field><field name="category.top">rfc5646:en</field><field name="allMeta">Englisch</field><field name="allMeta">English</field><field name="allMeta">eng</field><field name="allMeta">eng</field><field name="mods.title">An</field><field name="mods.title">algorithm for optimal multileaf collimator field segmentation with interleaf collision constraint 2</field><field name="mods.title.main">An algorithm for optimal multileaf collimator field segmentation with interleaf collision constraint 2</field><field name="mods.title.subtitle"></field><doc><field name="id">rosdok_document_0000028042-d4011766e50</field><field name="mods.name">Thomas Kalinowski</field><field name="mods.name.top">Thomas Kalinowski</field></doc><field name="mods.name">Thomas Kalinowski</field><field name="mods.name.top">Thomas Kalinowski</field><field name="mods.author">Thomas Kalinowski</field><field name="mods.place">Rostock</field><field name="mods.publisher">University of Rostock,  Institute of Mathematics</field><field name="mods.genre">epub.workingpaper</field><field name="mods.identifier">https://purl.uni-rostock.de/rosdok/id00005906</field><field name="mods.identifier">urn:nbn:de:gbv:28-rosdok_id00005906-8</field><field name="mods.identifier">10.18453/rosdok_id00005906</field><field name="mods.abstract">Multileaf collimators are widely used in radiotherapy to realize intensity modulated fields as superpositions of homogeneous fields, so called segments. One important step in the planning process is the decomposition of the modulated field into a small number of segments such that the total number of monitor units is also small. In this paper we present an algorithm that is based on the results of [6] and constructs a segmentation with minimal total number of monitor units and a small number of segments, taking into account a machine–dependent constraint, that forbids leaf overtravel in adjacent rows of the multileaf collimator.</field><field name="mods.dateIssued">2003</field><field name="mods.yearIssued">2003</field><field name="mods.title.series">Preprints aus dem Institut für Mathematik</field><field name="allMeta">rosdok_id00005816</field><field name="allMeta">1986139832</field><field name="allMeta">Odv</field><field name="allMeta">https://purl.uni-rostock.de/rosdok/id00005816</field><field name="allMeta">Preprints aus dem Institut für Mathematik</field><field name="allMeta">3255797-8</field><field name="allMeta">03/8</field><field name="allMeta">0003-0008</field><field name="mods.identifier.series">https://purl.uni-rostock.de/rosdok/id00005816</field><field name="mods.identifier.series">3255797-8</field><field name="mods.relatedItem"></field><field name="mods.relatedItem.series"></field><field name="mods.note.statement of responsibility">Thomas Kalinowski</field><field name="mods.type">epub.workingpaper</field><field name="search_result_link_text">1
        Kalinowski_algorithm_2003.pdf
        
        167408
        0daa6812107e49ad330b22c2fa9ddaed
      
    
  
  
    
      
        rosdok_id000059061987387872Oau2026-10-222026-10-23T08:51:00ZrdaConverted from PICA to MODS using Pica2MODS XSLT Transformer 2.14-SNAPSHOT [SCM: "" "" ""] with mode 'DEFAULT'.WorkingpaperAnalgorithm for optimal multileaf collimator field segmentation with interleaf collision constraint 2Multileaf collimators are widely used in radiotherapy to realize intensity modulated fields as superpositions of homogeneous fields, so called segments. One important step in the planning process is the decomposition of the modulated field into a small number of segments such that the total number of monitor units is also small. In this paper we present an algorithm that is based on the results of [6] and constructs a segmentation with minimal total number of monitor units and a small number of segments, taking into account a machine–dependent constraint, that forbids leaf overtravel in adjacent rows of the multileaf collimator.ThomasKalinowskiVerfasserInauthttps://purl.uni-rostock.de/rosdok/id00005906urn:nbn:de:gbv:28-rosdok_id00005906-810.18453/rosdok_id00005906510 MathematikMathematisch-Naturwissenschaftliche Fakultätalle Rechte vorbehaltenRechteinhaber Universität Rostockfrei zugänglich (Open Access)Lizenz Metadaten: CC0en1 Online-Ressource (10 Seiten)2003University of Rostock,  Institute of MathematicsRostockmonographic20032026Universitätsbibliothek RostockRostock2026Universitätsbibliothek Rostockhttps://purl.uni-rostock.de/rosdok/id00005906Thomas Kalinowskirosdok_id000058161986139832Odvhttps://purl.uni-rostock.de/rosdok/id00005816Preprints aus dem Institut für Mathematik3255797-803/80003-0008
      
    
  
  
    
      2026-10-22T14:02:36.728Z
      2026-10-23T08:51:01.434Z
      2026-11-02T08:51:01.465Z
    
    
      editorKE
      {"identifier":"rosdok/id00005906","type":"local_id","additional":"","service":"MCRLocalID","created":"2026-10-22T14:02:36.760Z"}
      {"identifier":"urn:nbn:de:gbv:28-rosdok_id00005906-8","type":"dnbUrn","additional":"","service":"RosDokURN","created":"2026-10-22T14:02:36.773Z"}
      {"identifier":"https://purl.uni-rostock.de/rosdok/id00005906","type":"purl","additional":"","service":"RosDokPURL","created":"2026-10-22T14:02:36.778Z","registrationStarted":"2026-10-22T15:26:37.333Z"}
      {"identifier":"10.18453/rosdok_id00005906","type":"doi","additional":"","service":"RosDokDOI","created":"2026-10-22T14:02:36.783Z","registrationStarted":"2026-10-22T15:26:37.043Z","registered":"2026-10-22T15:26:38.579Z"}
      editorKE</field><field name="derivateLabel">fulltext</field><field name="ir.pdffulltext_url">file/rosdok_document_0000028042/rosdok_derivate_0000229943/Kalinowski_algorithm_2003.pdf</field><field name="mods.title">An</field><field name="mods.title">algorithm for optimal multileaf collimator field segmentation with interleaf collision constraint 2</field><field name="mods.title.main">An algorithm for optimal multileaf collimator field segmentation with interleaf collision constraint 2</field><field name="mods.title.subtitle"></field><doc><field name="id">rosdok_document_0000028042-d4011766e50</field><field name="mods.name">Thomas Kalinowski</field><field name="mods.name.top">Thomas Kalinowski</field></doc><field name="mods.name">Thomas Kalinowski</field><field name="mods.name.top">Thomas Kalinowski</field><field name="mods.author">Thomas Kalinowski</field><field name="mods.place">Rostock</field><field name="mods.publisher">University of Rostock,  Institute of Mathematics</field><field name="mods.genre">epub.workingpaper</field><field name="mods.identifier">https://purl.uni-rostock.de/rosdok/id00005906</field><field name="mods.identifier">urn:nbn:de:gbv:28-rosdok_id00005906-8</field><field name="mods.identifier">10.18453/rosdok_id00005906</field><field name="mods.abstract">Multileaf collimators are widely used in radiotherapy to realize intensity modulated fields as superpositions of homogeneous fields, so called segments. One important step in the planning process is the decomposition of the modulated field into a small number of segments such that the total number of monitor units is also small. In this paper we present an algorithm that is based on the results of [6] and constructs a segmentation with minimal total number of monitor units and a small number of segments, taking into account a machine–dependent constraint, that forbids leaf overtravel in adjacent rows of the multileaf collimator.</field><field name="mods.dateIssued">2003</field><field name="mods.yearIssued">2003</field><field name="mods.title.series">Preprints aus dem Institut für Mathematik</field><field name="allMeta">rosdok_id00005816</field><field name="allMeta">1986139832</field><field name="allMeta">Odv</field><field name="allMeta">https://purl.uni-rostock.de/rosdok/id00005816</field><field name="allMeta">Preprints aus dem Institut für Mathematik</field><field name="allMeta">3255797-8</field><field name="allMeta">03/8</field><field name="allMeta">0003-0008</field><field name="mods.identifier.series">https://purl.uni-rostock.de/rosdok/id00005816</field><field name="mods.identifier.series">3255797-8</field><field name="mods.relatedItem"></field><field name="mods.relatedItem.series"></field><field name="mods.note.statement of responsibility">Thomas Kalinowski</field><field name="ir.identifier">[xslt]Saxon</field><field name="recordIdentifier">rosdok_id00005906</field><field name="purl">https://purl.uni-rostock.de/rosdok/id00005906</field><field name="ppn">1987387872</field><field name="doi">10.18453/rosdok_id00005906</field><field name="urn">urn:nbn:de:gbv:28-rosdok_id00005906-8</field><field name="ir.creator.result">Thomas Kalinowski</field><field name="ir.creator.sort">Kalinowski Thomas</field><field name="ir.title.result">An algorithm for optimal multileaf collimator field segmentation with interleaf collision constraint 2</field><field name="ir.doctype.result">Workingpaper</field><field name="ir.doctype_en.result">working paper</field><field name="ir.originInfo.result">University of Rostock,  Institute of Mathematics, 2003</field><field name="ir.abstract300.result">Multileaf collimators are widely used in radiotherapy to realize intensity modulated fields as superpositions of homogeneous fields, so called segments. One important step in the planning process is the decomposition of the modulated field into a small number of segments such that the total number…</field><field name="ir.host.recordIdentifier">rosdok_id00005816</field><field name="ir.sortstring">0003-0008</field><field name="ir.seriesNumber.result">03/8</field><field name="ir.creator_all">Thomas Kalinowski</field><field name="ir.title_all">An</field><field name="ir.title_all">algorithm for optimal multileaf collimator field segmentation with interleaf collision constraint 2</field><field name="ir.title_all">Preprints aus dem Institut für Mathematik</field><field name="ir.location_all">Universitätsbibliothek Rostock</field><field name="ir.location_all">https://purl.uni-rostock.de/rosdok/id00005906</field><field name="ir.creator_all">Thomas</field><field name="ir.creator_all">Kalinowski</field><field name="ir.creator_all"></field><field name="ir.creator_all">VerfasserIn</field><field name="ir.creator_all">aut</field><field name="ir.identifier">[purl]https://purl.uni-rostock.de/rosdok/id00005906</field><field name="ir.identifier">[urn]urn:nbn:de:gbv:28-rosdok_id00005906-8</field><field name="ir.identifier">[doi]10.18453/rosdok_id00005906</field><field name="ir.oai.setspec.open_access">open_access</field><field name="ir.pubyear_start">2003</field><field name="ir.pubyear_end">2003</field><field name="ir.epoch_class.facet">epoch:21th_century</field><field name="ir.language_class.facet">rfc5646:en</field><field name="ir.doctype_class.facet">doctype:epub.workingpaper</field><field name="ir.accesscondition_class.facet">accesscondition:openaccess</field><field name="ir.sdnb_class.facet">SDNB:510</field><field name="ir.institution_class.facet">institution:unirostock.mnf</field><field name="ir.state_class.facet">state:published</field></doc></add>