Beating the spread, time-optimal point meshing

DOI10.1145/1998196.1998252MaRDI QIDQ5404446zbMATH OpenOpenAlexFDO

Authors Todd Phillips, Donald R. Sheehy, Gary L. Miller

Publication date 24 March 2014

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

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

zbMATH Keywords

epsilon netsmesh generationrange spacessparse Voronoi refinementspread

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

• A fast algorithm for well-spaced points and approximate Delaunay graphs
• A time-optimal delaunay refinement algorithm in two dimensions
• A time efficient Delaunay refinement algorithm

Cited in

(7)

• A fast algorithm for point-location in a finite element mesh
• Complex root finding algorithm based on Delaunay triangulation
• Approximating nearest neighbor distances
• A fast algorithm for well-spaced points and approximate Delaunay graphs
• Spreading points using gradient and tabu
• Dimension-splitting data points redistribution for meshless approximation
• A sparse Delaunay filtration

This page was built for publication: Beating the spread, time-optimal point meshing

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