Computational Geometry Methods and Intelligent Computing
From MaRDI portal
Publication:3628356
Recommendations
Cites work
- DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\).
- Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
- scientific article; zbMATH DE number 1033560 (Why is no real title available?)
- scientific article; zbMATH DE number 1079755 (Why is no real title available?)
- scientific article; zbMATH DE number 2087065 (Why is no real title available?)
- Tetrahedrizing point sets in three dimensions
- Updating the topology of the dynamic Voronoi diagram for spheres in Euclidean \(d\)-dimensional space
Cited in
(2)
This page was built for publication: Computational Geometry Methods and Intelligent Computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3628356)