Star splaying

DOI10.1145/1064092.1064129MaRDI QIDQ5370618zbMATH OpenOpenAlexFDO

Authors Richard Shewchuk

Publication date 20 October 2017

Published in Proceedings of the twenty-first annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1064092.1064129

zbMATH Keywords

convex hullDelaunay repairDelaunay triangulationdynamic mesh generationstar flippingstar splaying

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Strongly-Delaunay starshaped polygons
• Fast reconstruction of Delaunay triangulations
• Linear-time reconstruction of Delaunay triangulations with applications
• Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix
• A lower bound for splines on tetrahedral vertex stars
• Computing correct Delaunay triangulations
• Improved stretch factor of Delaunay triangulations of points in convex position
• Improved stretch factor of Delaunay triangulations of points in convex position
• scientific article; zbMATH DE number 1200214
• scientific article; zbMATH DE number 1496540

Cited in

(5)

• A distributed algorithm to maintain a proximity communication network among mobile agents using the Delaunay triangulation
• A package for exact kinetic data structures and sweepline algorithms
• Manifold reconstruction using tangential Delaunay complexes
• Anisotropic Delaunay mesh generation
• Large-scale semi-discrete optimal transport with distributed Voronoi diagrams

This page was built for publication: Star splaying

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