Parallelized ear clipping for the triangulation and constrained Delaunay triangulation of polygons

DOI10.1016/j.comgeo.2018.01.004zbMath1443.68200OpenAlexW2800234772WikidataQ129860077 ScholiaQ129860077MaRDI QIDQ1615773

Martin Held, Peter Palfrader, Günther Eder

Publication date: 31 October 2018

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2018.01.004

zbMATH Keywords

parallelizationmulti-corepolygon triangulationconstrained Delaunay triangulation (CDT)ear-clipping

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (2)

Arbitrary polygon mesh for elastic and elastoplastic analysis of solids using smoothed finite element method ⋮ Optimal Area Polygonization by Triangulation and Visibility Search

Uses Software

• Triangle
• FIST
• Algorithm 872

Cites Work

• Unnamed Item
• Planar separators and parallel polygon triangulation.
• Adaptive precision floating-point arithmetic and fast robust geometric predicates
• Reentrant polygon clipping
• Algorithm 872
• RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS
• Polygons Have Ears
• Triangulating a polygon in parallel
• FIST: fast industrial-strength triangulation of polygons

This page was built for publication: Parallelized ear clipping for the triangulation and constrained Delaunay triangulation of polygons