A triangulation algorithm based on edge-pointer search and region-division

DOI10.16383/J.AAS.C190155MaRDI QIDQ4998040zbMATH OpenWikidataFDO

Authors Jun Zhang, Huimin Tian

Publication date 1 July 2021

Full work available at URL https://doi.org/10.16383/J.AAS.C190155

zbMATH Keywords

3D reconstructionDelaunay triangulationedge-pointerregion-division

Mathematics Subject Classification ID

Data structures (68P05) Computational aspects of data analysis and big data (68T09) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Recommendations

• A faster circle-sweep Delaunay triangulation algorithm
• DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\).
• An algorithm for dynamic Delaunay triangulation of simple polygon
• Algorithms – ESA 2005
• Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix

This page was built for publication: A triangulation algorithm based on edge-pointer search and region-division

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