A new triangulation-linear class of simple polygons

DOI10.1080/00207168708803587zbMath0656.68048OpenAlexW2026465854MaRDI QIDQ3804191

Sang-Ho Lee, Kyung-Yong Chwa

Publication date: 1987

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168708803587

zbMATH Keywords

time complexitycomputational geometrylinear-time algorithmsimple polygontriangulation-linear classes

Mathematics Subject Classification ID

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

Related Items (3)

On geodesic properties of polygons relevant to linear time triangulation ⋮ Some chain visibility problems in a simple polygon ⋮ Testing a simple polygon for monotonicity optimally in parallel

Cites Work

• Unnamed Item
• Triangulating a simple polygon
• Triangulation and shape-complexity
• Triangulating Simple Polygons and Equivalent Problems
• An Optimal Algorithm for Finding the Kernel of a Polygon
• Measuring Concavity on a Rectangular Mosaic

This page was built for publication: A new triangulation-linear class of simple polygons