An algorithm for dynamic Delaunay triangulation of simple polygon

MaRDI QIDQ2887614zbMATH OpenFDO

Authors Xiaohua Luo, Wenchao Fu, Peixiang Guan, Chuanlin Zhang

Publication date 1 June 2012

Published in Journal of Jinan University. Natural Science \& Medicine Edition (Search for Journal in Brave)

zbMATH Keywords

algorithmDelaunay triangulationmesh generationsimple polygonempty circlePython language

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• An optimal algorithm for realizing a Delaunay triangulation
• A contribution to triangulation algorithms for simple polygons
• A fast algorithm for constructing Delaunay triangulations in the plane
• scientific article; zbMATH DE number 1225873
• A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems
• Dynamic algorithms for visibility polygons in simple polygons
• A time efficient Delaunay refinement algorithm
• A faster divide-and-conquer algorithm for constructing Delaunay triangulations
• A fast algorithm for generating constrained delaunay triangulations

Cited in

(7)

• An empirical comparison of techniques for updating Delaunay triangulations
• scientific article; zbMATH DE number 177537 (Why is no real title available?)
• Dynamic and robust local clearance triangulations
• A triangulation algorithm based on edge-pointer search and region-division
• Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation
• A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation
• A simple algorithm for higher-order Delaunay mosaics and alpha shapes

Describes a project that uses

Uses Software

• Python

This page was built for publication: An algorithm for dynamic Delaunay triangulation of simple polygon

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