期刊
COMPUTER-AIDED DESIGN
卷 45, 期 4, 页码 843-852出版社
ELSEVIER SCI LTD
DOI: 10.1016/j.cad.2011.09.004
关键词
Clipped Voronoi diagram; Delaunay triangulation; Centroidal Voronoi tessellation; Mesh generation
资金
- Research Grant Council of Hong Kong [718209, 718010]
- NSFC [60933008]
- European Research Council [GOODSHAPE FP7-ERC-StG-205693]
- ANR/NSFC Program (SHAN Project) [60625202, 60911130368]
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 cells of their Voronoi diagram are infinite or partially outside of the domain, 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 to compute the clipped Voronoi diagram for a set of sites with respect to a compact 2D region or a 3D volume. We also apply the proposed method to optimal mesh generation based on the centroidal Voronoi tessellation. Crown Copyright (C) 2011 Published by Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据