Xiaohan Liu
Dong-Ming Yan
ABSTRACT
Computing clipped Voronoi diagrams in 3D volume is a challenging problem. In this poster, we propose an efficient GPU implementation to tackle this problem. By discretizing the 3D volume into a tetrahedral mesh, the main idea of our approach is that we use the four planes of each tetrahedron (tet for short in the following) to clip the Voronoi cells, instead of using the bisecting planes of Voronoi cells to clip tets like previous approaches. This strategy reduces computational complexity drastically. Our approach outperforms the state-of-the-art CPU method up to one order of magnitude.
- Franz Aurenhammer. 1991. Voronoi diagrams—a survey of a fundamental geometric data structure. ACM Computing Surveys (CSUR) 23, 3 (1991), 345–405.Google Scholar
Digital Library
- Qiang Du, Vance Faber, and Max Gunzburger. 1999. Centroidal Voronoi tessellations: Applications and algorithms. SIAM review 41, 4 (1999), 637–676.Google Scholar
- Vincent Garcia, Eric Debreuve, Frank Nielsen, and Michel Barlaud. 2010. K-nearest neighbor search: Fast GPU-based implementations and application to high-dimensional feature matching. In 2010 IEEE ICIP. IEEE, 3757–3760.Google Scholar
- Jiawei Han, Dong-Ming Yan, Lili Wang, and Qinping Zhao. 2017. Computing restricted voronoi diagram on graphics hardware. In Pacific Graphics 2017. Eurographics Association, 23–26.Google Scholar
- Nicolas Ray, Dmitry Sokolov, Sylvain Lefebvre, and Bruno Lévy. 2018. Meshless Voronoi on the GPU. ACM Trans. on Graphics 37, 6, Article 265 (Dec. 2018), 12 pages.Google ScholarDigital Library
- Guodong Rong, Miao Jin, Liang Shuai, and Xiaohu Guo. 2011. Centroidal Voronoi tessellation in universal covering space of manifold surfaces. Computer Aided Geometric Design 28, 8 (2011), 475–496.Google ScholarDigital Library
- Dong-Ming Yan, Wenping Wang, Bruno Lévy, and Yang Liu. 2013. Efficient computation of clipped Voronoi diagram for mesh generation. Computer-Aided Design 45, 4 (2013), 843–852.Google ScholarDigital Library
Index Terms
- Computing 3D Clipped Voronoi Diagrams on GPU
Recommendations
Meshless voronoi on the GPU
We propose a GPU algorithm that computes a 3D Voronoi diagram. Our algorithm is tailored for applications that solely make use of the geometry of the Voronoi cells, such as Lloyd's relaxation used in meshing, or some numerical schemes used in fluid ...
Efficient computation of clipped Voronoi diagram for mesh generation
The Voronoi diagram is a fundamental geometric structure widely used in various fields, especially in computer graphics and geometry computing. For a set of points in a compact domain (i.e. a bounded and closed 2D region or a 3D volume), some Voronoi ...
Efficient computation of 3d clipped voronoi diagram
GMP'10: Proceedings of the 6th international conference on Advances in Geometric Modeling and ProcessingThe 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 ...
Comments