An algorithm for constructing the convex hull of a set of spheres in dimension d
Computational Geometry: Theory and Applications
On the combinatorial complexity of euclidean Voronoi cells and convex hulls of d-dimensional spheres
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Root comparison techniques applied to computing the additively weighted Voronoi diagram
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
Dynamic Additively Weighted Voronoi Diagrams in 2D
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Provably good surface sampling and approximation
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Voronoi diagrams of semi-algebraic sets
Voronoi diagrams of semi-algebraic sets
Variational tetrahedral meshing
ACM SIGGRAPH 2005 Papers
The predicates for the Voronoi diagram of ellipses
Proceedings of the twenty-second annual symposium on Computational geometry
Computing the Voronoi cells of planes, spheres and cylinders in R3
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Approximating the pathway axis and the persistence diagram of a collection of balls in 3-space
Proceedings of the twenty-fourth annual symposium on Computational geometry
Computing the Voronoi cells of planes, spheres and cylinders in R3
Computer Aided Geometric Design
Manifoldization of β-shapes in O(n) time
Computer-Aided Design
Quasi-worlds and quasi-operators on quasi-triangulations
Computer-Aided Design
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Protein-ligand docking based on beta-shape
Transactions on computational science IX
Protein-ligand docking based on beta-shape
Transactions on computational science IX
Transactions on Computational Science XIV
Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities
Information Sciences: an International Journal
| Hi-index | 0.00 |
We provide a complete description of dynamic algorithms for constructing convex hulls and Voronoi diagrams of additively weighted points of ${\mathbb R}^{d}$. We present simple algorithms and provide a description of the predicates. The algorithms have been implemented in ${\mathbb R}^{3}$ and experimental results are reported. Our implementation follows the CGAL design and, in particular, is made both robust and efficient through the use of filtered exact arithmetic.