A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems
From MaRDI portal
(Redirected from Publication:4371752)
Recommendations
Cited in
(13)- Extracting and representing qualitative behaviors of complex systems in phase space
- Regular triangulations of dynamic sets of points
- An algorithm for dynamic Delaunay triangulation of simple polygon
- A Constrained Two-Dimensional Triangulation and the Solution of Closest Node Problems in the Presence of Barriers
- A faster circle-sweep Delaunay triangulation algorithm
- OPTIMAL DELAUNAY POINT INSERTION
- scientific article; zbMATH DE number 1139074 (Why is no real title available?)
- Dynamic T‐search for accelerating searching speeds in Delaunay triangulation
- Dynamic proximity calculations for situation awareness
- scientific article; zbMATH DE number 2088191 (Why is no real title available?)
- Algorithm 1012
- \textit{OFC}-Delaunay triangulation: a new efficient algorithm for merging two adjacent Delaunay triangulations
- A data modeling abstraction for describing triangular mesh algorithms
This page was built for publication: A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371752)