Polygon triangulation: Efficiency and minimality

DOI10.1016/0196-6774(86)90005-2MaRDI QIDQ3742737zbMATH OpenOpenAlexFDO

Authors T. Asano, Tetsuo Asano, Ron Y. Pinter

Publication date 1986

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(86)90005-2

zbMATH Keywords

holesminimum-number triangulationspartitioning a polygonal regionpolynomial time algorithm

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Recommendations

• On the minimality of polygon triangulation
• Triangulating Simple Polygons and Equivalent Problems
• Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures
• Linear-size nonobtuse triangulation of polygons
• An O(n\log \log n)-Time Algorithm for Triangulating a Simple Polygon

Cited in

(12)

• Triangulations (tilings) and certain block triangular matrices
• Draining a polygon-or-rolling a ball out of a polygon
• scientific article; zbMATH DE number 701117 (Why is no real title available?)
• TRIANGULATING DISJOINT JORDAN CHAINS
• scientific article; zbMATH DE number 1747707 (Why is no real title available?)
• Triangle-Based Heuristics for Area Optimal Polygonizations
• REGION INTERVISIBILITY IN TERRAINS
• Time-space trade-offs for triangulating a simple polygon
• Graph Drawing
• Minimum star partitions of simple polygons in polynomial time
• Pizza sharing is PPA-hard
• On the minimality of polygon triangulation

This page was built for publication: Polygon triangulation: Efficiency and minimality

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