On decomposing polygons into uniformly monotone parts
Information Processing Letters
A minimum spanning tree algorithm with inverse-Ackermann type complexity
Journal of the ACM (JACM)
Optimal Polygon Cover Problems and Applcations
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Maximum Red/Blue Interval Matching with Applications
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Robotic Radiosurgery with Beams of Adaptable Shapes
CVRMed '95 Proceedings of the First International Conference on Computer Vision, Virtual Reality and Robotics in Medicine
Finding an Optimal Path without Growing the Tree
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Geometric algorithms for static leaf sequencing problems in radiation therapy
Proceedings of the nineteenth annual symposium on Computational geometry
Mountain reduction, block matching, and applications in intensity-modulated radiation therapy
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
The intensity level reduction in radiation therapy
Proceedings of the 2005 ACM symposium on Applied computing
Efficient intensity map splitting algorithms for intensity-modulated radiation therapy
Information Processing Letters
Efficient algorithms for intensity map splitting problems in radiation therapy
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Generalized geometric approaches for leaf sequencing problems in radiation therapy,
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Generalized geometric approaches for leaf sequencing problems in radiation therapy
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Maximum weight digital regions decomposable into digital star-shaped regions
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
On maximum weight objects decomposable into based rectilinear convex objects
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
In this paper, we study several rectilinear terrain construction problems, which model leaf sequencing problems in intensity-modulated radiation therapy (IMRT). We present a novel unified approach based on geometric techniques for solving these terrain construction problems. Our approach leads to the first algorithms for several leaf sequencing problems in IMRT that are practically fast and guarantee the optimal quality of the output solutions. Our implementation results show that our terrain construction algorithms run very fast on real medical data.