Abstract
The Voronoi diagram is a fundamental geometry structure widely used in various fields, especially in computer graphics and geometry computing. For a set of points in a compact 3D domain (i.e. a finite 3D volume), some Voronoi cells of their Voronoi diagram are infinite, but in practice only the parts of the cells inside the domain are needed, as when computing the centroidal Voronoi tessellation. Such a Voronoi diagram confined to a compact domain is called a clipped Voronoi diagram. We present an efficient algorithm for computing the clipped Voronoi diagram for a set of sites with respect to a compact 3D volume, assuming that the volume is represented as a tetrahedral mesh. We also describe an application of the proposed method to implementing a fast method for optimal tetrahedral mesh generation based on the centroidal Voronoi tessellation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
CGAL, Computational Geometry Algorithms Library, http://www.cgal.org
Alliez, P., Cohen-Steiner, D., Yvinec, M., Desbrun, M.: Variational tetrahedral meshing. ACM Transactions on Graphics (Proceedings of ACM SIGGRAPH 2005) 24(3), 617–625 (2005)
Alliez, P., Ucelli, G., Gotsman, C., Attene, M.: Recent advances in remeshing of surfaces. Shape Analysis and Structuring, 53–82 (2008)
Aurenhammer, F.: Voronoi diagrams: a survey of a fundamental geometric data structure. ACM Computing Surveys 23(3), 345–405 (1991)
Balzer, M., Deussen, O.: Voronoi treemaps. In: Proceedings of the 2005 ACM Symposium on Software Visualization, pp. 165–172 (2005)
Barber, C.B., Dobkin, D.P., Huhdanpaa, H.: The quickhull algorithm for convex hulls. ACM Trans. Math. Software 22, 469–483 (1996)
Du, Q., Faber, V., Gunzburger, M.: Centroidal Voronoi tessellations: applications and algorithms. SIAM Review 41(4), 637–676 (1999)
Du, Q., Gunzburger, M., Ju, L.: Advances in studies and applications of centroidal Voronoi tessellations. Numer. Math. Theor. Meth. Appl. (to appear 2010)
Edelsbrunner, H., Shah, N.R.: Triangulating topological spaces. Int. J. Comput. Geometry Appl. 7(4), 365–378 (1997)
Fortune, S.: Voronoi diagrams and Delaunay triangulations. In: Computing in Euclidean Geometry, pp. 193–233 (1992)
Gold, C.M.: What is GIS and what is not? Transactions in GIS 10(4), 505–519 (2006)
Hoff III, K.E., Keyser, J., Lin, M.C., Manocha, D.: Fast computation of generalized Voronoi diagrams using graphics hardware. In: Proceedings of ACM SIGGRAPH 1999, pp. 277–286 (1999)
Iri, M., Murota, K., Ohya, T.: A fast Voronoi diagram algorithm with applications to geographical optimization problems. In: Proceedings of the 11th IFIP Conference on System Modelling and Optimization, pp. 273–288 (1984)
Liu, Y., Wang, W., Lévy, B., Sun, F., Yan, D.-M., Lu, L., Yang, C.: On centroidal Voronoi tessellation: Energy smoothness and fast computation. ACM Transactions on Graphics 28(4), Article No. 101 (2009)
Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, 2nd edn. Wiley, Chichester (2000)
Poupon, A.: Voronoi and Voronoi-related tessellations in studies of protein structure and interaction. Current Opinion in Structural Biology 14(2), 233–241 (2004)
Si, H.: TetGen: A quality tetrahedral mesh generator and three-dimensional Delaunay triangulator, http://tetgen.berlios.de/
Sud, A., Andersen, E., Curtis, S., Lin, M.C., Manocha, D.: Real-time path planning in dynamic virtual environments using multiagent navigation graphs. IEEE Transactions on Visualization and Computer Graphics 14(3), 526–538 (2008)
Sud, A., Govindaraju, N.K., Gayle, R., Kabul, I., Manocha, D.: Fast proximity computation among deformable models using discrete Voronoi diagrams. ACM Transactions on Graphics (Proceedings of ACM SIGGRAPH 2006) 25(3), 1144–1153 (2006)
Sutherland, I.E., Hodgman, G.W.: Reentrant polygon clipping. Communications of the ACM 17(1), 32–42 (1974)
Yan, D.-M.: Variational Shape Segmentation and Mesh Generation. Phd dissertation, The University of Hong Kong (2010)
Yan, D.-M., Lévy, B., Liu, Y., Sun, F., Wang, W.: Isotropic remeshing with fast and exact computation of restricted Voronoi diagram. Computer Graphics Forum (Proceedings of SGP 2009) 28(5), 1445–1454 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yan, DM., Wang, W., Lévy, B., Liu, Y. (2010). Efficient Computation of 3D Clipped Voronoi Diagram. In: Mourrain, B., Schaefer, S., Xu, G. (eds) Advances in Geometric Modeling and Processing. GMP 2010. Lecture Notes in Computer Science, vol 6130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13411-1_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-13411-1_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13410-4
Online ISBN: 978-3-642-13411-1
eBook Packages: Computer ScienceComputer Science (R0)