Abstract Voronoi diagram in 3-space
From MaRDI portal
Publication:1878678
DOI10.1016/j.jcss.2003.06.002zbMath1072.68111OpenAlexW1996868358MaRDI QIDQ1878678
Publication date: 8 September 2004
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2003.06.002
Related Items
Abstract Voronoi diagrams revisited, An approximation algorithm for computing shortest paths in weighted 3-d domains, Voronoi polytopes for polyhedral norms on lattices, Abstract Voronoi Diagrams from Closed Bisecting Curves
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On non-smooth convex distance functions
- Randomized incremental construction of abstract Voronoi diagrams
- On the construction of abstract Voronoi diagrams
- Voronoi diagrams and arrangements
- A sweepline algorithm for Voronoi diagrams
- Dirichlet regions in manifolds without conjugate points
- Voronoi diagrams from convex hulls
- Concrete and abstract Voronoi diagrams
- Randomized incremental construction of simple abstract Voronoi diagrams in 3-space
- Voronoi diagrams in higher dimensions under certain polyhedral distance functions
- Applications of random sampling in computational geometry. II
- On Voronoi diagrams in the \(L_p\)-metric in \(\mathbb{R}^D\).
- The union of flat (𝑛-1)-balls is flat in 𝑅ⁿ
- Taming codimension three embeddings
