A new triangulation-linear class of simple polygons

DOI10.1080/00207168708803587MaRDI QIDQ3804191zbMATH OpenOpenAlexFDO

Authors 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

computational geometrylinear-time algorithmsimple polygontime complexitytriangulation-linear classes

Mathematics Subject Classification ID

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

Recommendations

• A new linear algorithm for triangulating monotone polygons
• Linear-time algorithms for weakly-monotone polygons
• Triangulating Simple Polygons and Equivalent Problems
• scientific article; zbMATH DE number 3932438
• On geodesic properties of polygons relevant to linear time triangulation

Cites work

• An Optimal Algorithm for Finding the Kernel of a Polygon
• scientific article; zbMATH DE number 3825165 (Why is no real title available?)
• Measuring Concavity on a Rectangular Mosaic
• Triangulating a simple polygon
• Triangulating Simple Polygons and Equivalent Problems
• Triangulation and shape-complexity

Cited in

(5)

• On geodesic properties of polygons relevant to linear time triangulation
• A new linear algorithm for triangulating monotone polygons
• Linear-time algorithms for weakly-monotone polygons
• Testing a simple polygon for monotonicity optimally in parallel
• Some chain visibility problems in a simple polygon

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3804191)