On decomposing polygons into uniformly monotone parts

DOI10.1016/0020-0190(88)90097-XzbMath0654.68049WikidataQ29398646 ScholiaQ29398646MaRDI QIDQ1108793

Robin Liu, Simeon C. Ntafos

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

computational geometrypolygon decompositionmonotone polygons

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other problems of combinatorial convexity (52A37)

Related Items (4)

GEOMETRIC ALGORITHMS FOR STATIC LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY ⋮ Approximation algorithms for decomposing octilinear polygons ⋮ Finding a maximum set of independent chords in a circle ⋮ TERRAIN DECOMPOSITION AND LAYERED MANUFACTURING

Cites Work

• Unnamed Item
• A linear algorithm for computing the visibility polygon from a point
• Orientations of circle graphs
• Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition
• Location of a Point in a Planar Subdivision and Its Applications
• Algorithms for a maximum clique and a maximum independent set of a circle graph

This page was built for publication: On decomposing polygons into uniformly monotone parts