On decomposing polygons into uniformly monotone parts
From MaRDI portal
Publication:1108793
DOI10.1016/0020-0190(88)90097-XzbMath0654.68049WikidataQ29398646 ScholiaQ29398646MaRDI QIDQ1108793
Publication date: 1988
Published in: Information Processing Letters (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
52A37: Other problems of combinatorial convexity
Related Items
TERRAIN DECOMPOSITION AND LAYERED MANUFACTURING, GEOMETRIC ALGORITHMS FOR STATIC LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY, Finding a maximum set of independent chords in a circle