Computational Geometry Methods and Intelligent Computing
From MaRDI portal
Publication:3628356
DOI10.1007/978-3-540-85126-4_1zbMath1165.52002OpenAlexW1593069213MaRDI QIDQ3628356
Publication date: 20 May 2009
Published in: Generalized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85126-4_1
Proceedings, conferences, collections, etc. pertaining to convex and discrete geometry (52-06) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
- DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\).
- Updating the topology of the dynamic Voronoi diagram for spheres in Euclidean \(d\)-dimensional space
- Tetrahedrizing point sets in three dimensions
This page was built for publication: Computational Geometry Methods and Intelligent Computing