FIST: fast industrial-strength triangulation of polygons

DOI10.1007/S00453-001-0028-4zbMath0980.65019OpenAlexW1999011824MaRDI QIDQ5940610

No author found.

Publication date: 9 August 2001

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0028-4

zbMATH Keywords

numerical examplespolygonbounding volume treesfast industrial-strength triangulationgeometric hashinggraphics packagestriangulation algorithm

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (8)

Parallelized ear clipping for the triangulation and constrained Delaunay triangulation of polygons ⋮ 2-Opt Moves and Flips for Area-optimal Polygonizations ⋮ Optimal Area Polygonization by Triangulation and Visibility Search ⋮ Adaptive skin meshes coarsening for biomolecular simulation ⋮ VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments ⋮ Approximate convex decomposition of polygons ⋮ Product Gauss cubature over polygons based on Green's integration formula ⋮ A practical algorithm for decomposing polygonal domains into convex polygons by diagonals

Uses Software

• FIST

This page was built for publication: FIST: fast industrial-strength triangulation of polygons