Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/26788
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.rights.license | Elsevier User License | en |
dc.contributor.author | Kalinowski, Thomas | en |
dc.date.accessioned | 2019-04-24T06:48:39Z | - |
dc.date.available | 2019-04-24T06:48:39Z | - |
dc.date.issued | 2005 | - |
dc.identifier.citation | Discrete Applied Mathematics, 152(1-3), p. 52-88 | en |
dc.identifier.issn | 1872-6771 | en |
dc.identifier.issn | 0166-218X | en |
dc.identifier.uri | https://hdl.handle.net/1959.11/26788 | - |
dc.description.abstract | Intensity maps are non-negative matrices describing the intensity modulation of beams in radiotherapy. An important step in the planning process is to determine a segmentation, that is a representation of an intensity map as a positive combination of special matrices corresponding to fixed positions of the multileaf collimator, called segments. We consider the problem of constructing segmentations with small total numbers of monitor units and segments. Generalizing the approach of Engel [Discrete Appl. Math., https://doi.org/10.1016/j.dam.2004.10.007] so that it applies to the segmentation problem with interleaf collision constraint, we show that the minimal number of monitor units in this case can be interpreted as the maximal length of a path in a layered digraph. We derive an efficient algorithm that constructs a segmentation with this minimal number of monitor units, and we propose a heuristic approach to the reduction of the number of segments. | en |
dc.language | en | en |
dc.publisher | Elsevier BV, North-Holland | en |
dc.relation.ispartof | Discrete Applied Mathematics | en |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.title | A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint | en |
dc.type | Journal Article | en |
dc.identifier.doi | 10.1016/j.dam.2004.10.008 | en |
dcterms.accessRights | Gold | en |
local.contributor.firstname | Thomas | en |
local.subject.for2008 | 010303 Optimisation | en |
local.subject.for2008 | 010206 Operations Research | en |
local.subject.seo2008 | 970101 Expanding Knowledge in the Mathematical Sciences | en |
dcterms.RightsStatement | https://www.elsevier.com/about/policies/open-access-licenses/elsevier-user-license | en |
local.profile.school | School of Science and Technology | en |
local.profile.email | tkalinow@une.edu.au | en |
local.output.category | C1 | en |
local.record.place | au | en |
local.record.institution | University of New England | en |
local.publisher.place | Netherlands | en |
local.format.startpage | 52 | en |
local.format.endpage | 88 | en |
local.identifier.scopusid | 26444450530 | en |
local.peerreviewed | Yes | en |
local.identifier.volume | 152 | en |
local.identifier.issue | 1-3 | en |
local.access.fulltext | Yes | en |
local.contributor.lastname | Kalinowski | en |
dc.identifier.staff | une-id:tkalinow | en |
local.profile.orcid | 0000-0002-8444-6848 | en |
local.profile.role | author | en |
local.identifier.unepublicationid | une:1959.11/26788 | en |
local.date.onlineversion | 2005-07-11 | - |
dc.identifier.academiclevel | Academic | en |
local.title.maintitle | A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint | en |
local.output.categorydescription | C1 Refereed Article in a Scholarly Journal | en |
local.search.author | Kalinowski, Thomas | en |
local.uneassociation | Unknown | en |
local.year.available | 2005 | en |
local.year.published | 2005 | en |
local.fileurl.closedpublished | https://rune.une.edu.au/web/retrieve/256bcd6f-cec3-4a6d-85c8-1a009306946f | en |
Appears in Collections: | Journal Article School of Science and Technology |
Files in This Item:
File | Size | Format |
---|
SCOPUSTM
Citations
26
checked on May 4, 2024
Page view(s)
1,330
checked on Mar 9, 2023
This item is licensed under a Creative Commons License