<?xml version="1.0" encoding="UTF-8" standalone="yes"?><add><doc><field name="objectKind">mycoreobject</field><field name="id">rosdok_document_0000028045</field><field name="returnId">rosdok_document_0000028045</field><field name="objectProject">rosdok</field><field name="objectType">document</field><field name="link">rosdok_derivate_0000229946</field><field name="modified">2026-10-23T08:46:58.888Z</field><field name="created">2026-10-22T16:43:11.242Z</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_0000229946</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_id00005909</field><field name="allMeta">1987393066</field><field name="allMeta">Oau</field><field name="allMeta">2026-10-22</field><field name="allMeta">2026-10-23T08:46:57Z</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">A</field><field name="allMeta">new algorithm for optimal multileaf collimator field segmentation</field><field name="allMeta">We present a new efficient leaf sequencing algorithm for the generation of intensity maps by a nonnegative combination of segments. Intensity maps describe the intensity modulation of beams in radiotherapy. We only study the static case (stop and shoot) an optimize the total number of monitor units and the number of segments. We will present a short exact proof for a formula giving the smallest total number of monitor units and describe a class of algorithms yielding this minimal value. A special member of this class provides in addition a solution with a very small number of segments.</field><field name="allMeta">Konrad</field><field name="allMeta">Engel</field><field name="allMeta">1956 -</field><field name="allMeta">VerfasserIn</field><field name="allMeta">aut</field><field name="allMeta">138612366</field><field name="allMeta">https://purl.uni-rostock.de/rosdok/id00005909</field><field name="allMeta">urn:nbn:de:gbv:28-rosdok_id00005909-6</field><field name="allMeta">10.18453/rosdok_id00005909</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 (17 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/id00005909</field><field name="allMeta">Konrad Engel</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/5</field><field name="allMeta">0003-0005</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">A</field><field name="mods.title">new algorithm for optimal multileaf collimator field segmentation</field><field name="mods.title.main">A new algorithm for optimal multileaf collimator field segmentation</field><field name="mods.title.subtitle"></field><field name="mods.nameIdentifier">gnd:138612366</field><field name="mods.nameIdentifier.top">gnd:138612366</field><doc><field name="id">rosdok_document_0000028045-d3975716e50</field><field name="mods.nameIdentifier">gnd:138612366</field><field name="mods.name">Konrad Engel</field><field name="mods.name.top">Konrad Engel</field></doc><field name="mods.name">Konrad Engel</field><field name="mods.name.top">Konrad Engel</field><field name="mods.author">Konrad Engel</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/id00005909</field><field name="mods.identifier">urn:nbn:de:gbv:28-rosdok_id00005909-6</field><field name="mods.identifier">10.18453/rosdok_id00005909</field><field name="mods.abstract">We present a new efficient leaf sequencing algorithm for the generation of intensity maps by a nonnegative combination of segments. Intensity maps describe the intensity modulation of beams in radiotherapy. We only study the static case (stop and shoot) an optimize the total number of monitor units and the number of segments. We will present a short exact proof for a formula giving the smallest total number of monitor units and describe a class of algorithms yielding this minimal value. A special member of this class provides in addition a solution with a very small number of segments.</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/5</field><field name="allMeta">0003-0005</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">Konrad Engel</field><field name="mods.type">epub.workingpaper</field><field name="search_result_link_text">1
        Engel_algorithm_2003.pdf
        
        154531
        7d30031e42d87350854f894b4e94d205
      
    
  
  
    
      
        rosdok_id000059091987393066Oau2026-10-222026-10-23T08:46:57ZrdaConverted from PICA to MODS using Pica2MODS XSLT Transformer 2.14-SNAPSHOT [SCM: "" "" ""] with mode 'DEFAULT'.WorkingpaperAnew algorithm for optimal multileaf collimator field segmentationWe present a new efficient leaf sequencing algorithm for the generation of intensity maps by a nonnegative combination of segments. Intensity maps describe the intensity modulation of beams in radiotherapy. We only study the static case (stop and shoot) an optimize the total number of monitor units and the number of segments. We will present a short exact proof for a formula giving the smallest total number of monitor units and describe a class of algorithms yielding this minimal value. A special member of this class provides in addition a solution with a very small number of segments.KonradEngel1956 -VerfasserInaut138612366https://purl.uni-rostock.de/rosdok/id00005909urn:nbn:de:gbv:28-rosdok_id00005909-610.18453/rosdok_id00005909510 MathematikMathematisch-Naturwissenschaftliche Fakultätalle Rechte vorbehaltenRechteinhaber Universität Rostockfrei zugänglich (Open Access)Lizenz Metadaten: CC0en1 Online-Ressource (17 Seiten)2003University of Rostock,  Institute of MathematicsRostockmonographic20032026Universitätsbibliothek RostockRostock2026Universitätsbibliothek Rostockhttps://purl.uni-rostock.de/rosdok/id00005909Konrad Engelrosdok_id000058161986139832Odvhttps://purl.uni-rostock.de/rosdok/id00005816Preprints aus dem Institut für Mathematik3255797-803/50003-0005
      
    
  
  
    
      2026-10-22T16:43:11.242Z
      2026-10-23T08:46:58.888Z
      2026-11-02T08:46:58.921Z
    
    
      editorKE
      {"identifier":"rosdok/id00005909","type":"local_id","additional":"","service":"MCRLocalID","created":"2026-10-22T16:43:11.265Z"}
      {"identifier":"urn:nbn:de:gbv:28-rosdok_id00005909-6","type":"dnbUrn","additional":"","service":"RosDokURN","created":"2026-10-22T16:43:11.277Z"}
      {"identifier":"https://purl.uni-rostock.de/rosdok/id00005909","type":"purl","additional":"","service":"RosDokPURL","created":"2026-10-22T16:43:11.283Z","registrationStarted":"2026-10-23T08:03:38.696Z"}
      {"identifier":"10.18453/rosdok_id00005909","type":"doi","additional":"","service":"RosDokDOI","created":"2026-10-22T16:43:11.288Z","registrationStarted":"2026-10-23T08:03:38.387Z","registered":"2026-10-23T08:03:39.917Z"}
      editorKE</field><field name="derivateLabel">fulltext</field><field name="ir.pdffulltext_url">file/rosdok_document_0000028045/rosdok_derivate_0000229946/Engel_algorithm_2003.pdf</field><field name="mods.title">A</field><field name="mods.title">new algorithm for optimal multileaf collimator field segmentation</field><field name="mods.title.main">A new algorithm for optimal multileaf collimator field segmentation</field><field name="mods.title.subtitle"></field><field name="mods.nameIdentifier">gnd:138612366</field><field name="mods.nameIdentifier.top">gnd:138612366</field><doc><field name="id">rosdok_document_0000028045-d3975716e50</field><field name="mods.nameIdentifier">gnd:138612366</field><field name="mods.name">Konrad Engel</field><field name="mods.name.top">Konrad Engel</field></doc><field name="mods.name">Konrad Engel</field><field name="mods.name.top">Konrad Engel</field><field name="mods.author">Konrad Engel</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/id00005909</field><field name="mods.identifier">urn:nbn:de:gbv:28-rosdok_id00005909-6</field><field name="mods.identifier">10.18453/rosdok_id00005909</field><field name="mods.abstract">We present a new efficient leaf sequencing algorithm for the generation of intensity maps by a nonnegative combination of segments. Intensity maps describe the intensity modulation of beams in radiotherapy. We only study the static case (stop and shoot) an optimize the total number of monitor units and the number of segments. We will present a short exact proof for a formula giving the smallest total number of monitor units and describe a class of algorithms yielding this minimal value. A special member of this class provides in addition a solution with a very small number of segments.</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/5</field><field name="allMeta">0003-0005</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">Konrad Engel</field><field name="ir.identifier">[xslt]Saxon</field><field name="recordIdentifier">rosdok_id00005909</field><field name="purl">https://purl.uni-rostock.de/rosdok/id00005909</field><field name="ppn">1987393066</field><field name="doi">10.18453/rosdok_id00005909</field><field name="urn">urn:nbn:de:gbv:28-rosdok_id00005909-6</field><field name="ir.creator.result">Konrad Engel</field><field name="ir.creator.sort">Engel Konrad</field><field name="ir.title.result">A new algorithm for optimal multileaf collimator field segmentation</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">We present a new efficient leaf sequencing algorithm for the generation of intensity maps by a nonnegative combination of segments. Intensity maps describe the intensity modulation of beams in radiotherapy. We only study the static case (stop and shoot) an optimize the total number of monitor units…</field><field name="ir.host.recordIdentifier">rosdok_id00005816</field><field name="ir.sortstring">0003-0005</field><field name="ir.seriesNumber.result">03/5</field><field name="ir.creator_all">Konrad Engel</field><field name="ir.title_all">A</field><field name="ir.title_all">new algorithm for optimal multileaf collimator field segmentation</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/id00005909</field><field name="ir.creator_all">Konrad</field><field name="ir.creator_all">Engel</field><field name="ir.creator_all">1956 -</field><field name="ir.creator_all"></field><field name="ir.creator_all">VerfasserIn</field><field name="ir.creator_all">aut</field><field name="ir.creator_all">138612366</field><field name="ir.identifier">[purl]https://purl.uni-rostock.de/rosdok/id00005909</field><field name="ir.identifier">[urn]urn:nbn:de:gbv:28-rosdok_id00005909-6</field><field name="ir.identifier">[doi]10.18453/rosdok_id00005909</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>