A contribution to triangulation algorithms for simple polygons

DOI10.2498/CIT.2000.04.07MaRDI QIDQ2744733zbMATH OpenOpenAlexFDO

Authors Marko Lamot, Borut Žalik

Publication date 19 November 2001

Published in Journal of Computing and Information Technology (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NoDerivs 4.0 International

Full work available at URL https://doi.org/10.2498/cit.2000.04.07

zbMATH Keywords

computational geometrysimple polygon

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
• Triangulating Simple Polygons and Equivalent Problems
• scientific article; zbMATH DE number 515326
• A practical algorithm for decomposing polygonal domains into convex polygons by diagonals
• An O(n\log \log n)-Time Algorithm for Triangulating a Simple Polygon

Cited in

(9)

• An O(n\log \log n)-Time Algorithm for Triangulating a Simple Polygon
• An efficient algorithm for finding the CSG representation of a simple polygon
• Memory-constrained algorithms for simple polygons
• An algorithm for dynamic Delaunay triangulation of simple polygon
• A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
• Ear-slicing and quality triangulation
• A triangulation and fill-reducing initialization procedure for the simplex algorithm
• A heuristic triangulation algorithm
• A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation

This page was built for publication: A contribution to triangulation algorithms for simple polygons

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