Efficient computation of clipped Voronoi diagram for mesh generation

Handle URI:
http://hdl.handle.net/10754/562703
Title:
Efficient computation of clipped Voronoi diagram for mesh generation
Authors:
Yan, Dongming ( 0000-0003-2209-2404 ) ; Wang, Wen Ping; Lévy, Bruno L.; Liu, Yang
Abstract:
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 © 2011 Published by Elsevier Ltd. All rights reserved.
KAUST Department:
Visual Computing Center (VCC)
Publisher:
Elsevier
Journal:
CAD Computer Aided Design
Issue Date:
Apr-2013
DOI:
10.1016/j.cad.2011.09.004
Type:
Article
ISSN:
00104485
Sponsors:
We would like to thank anonymous reviewers for their detailed comments and suggestions which greatly improve the manuscript. We also thank one reviewer who pointed out the Ref. [1]. This work is partially supported by the Research Grant Council of Hong Kong (project no.: 718209 and 718010), the State Key Program of NSFC project (60933008), European Research Council (GOODSHAPE FP7-ERC-StG-205693), and ANR/NSFC (60625202, 60911130368) Program (SHAN Project).
Appears in Collections:
Articles; Visual Computing Center (VCC)

Full metadata record

DC FieldValue Language
dc.contributor.authorYan, Dongmingen
dc.contributor.authorWang, Wen Pingen
dc.contributor.authorLévy, Bruno L.en
dc.contributor.authorLiu, Yangen
dc.date.accessioned2015-08-03T11:02:13Zen
dc.date.available2015-08-03T11:02:13Zen
dc.date.issued2013-04en
dc.identifier.issn00104485en
dc.identifier.doi10.1016/j.cad.2011.09.004en
dc.identifier.urihttp://hdl.handle.net/10754/562703en
dc.description.abstractThe 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 © 2011 Published by Elsevier Ltd. All rights reserved.en
dc.description.sponsorshipWe would like to thank anonymous reviewers for their detailed comments and suggestions which greatly improve the manuscript. We also thank one reviewer who pointed out the Ref. [1]. This work is partially supported by the Research Grant Council of Hong Kong (project no.: 718209 and 718010), the State Key Program of NSFC project (60933008), European Research Council (GOODSHAPE FP7-ERC-StG-205693), and ANR/NSFC (60625202, 60911130368) Program (SHAN Project).en
dc.publisherElsevieren
dc.subjectCentroidal Voronoi tessellationen
dc.subjectClipped Voronoi diagramen
dc.subjectDelaunay triangulationen
dc.subjectMesh generationen
dc.titleEfficient computation of clipped Voronoi diagram for mesh generationen
dc.typeArticleen
dc.contributor.departmentVisual Computing Center (VCC)en
dc.identifier.journalCAD Computer Aided Designen
dc.contributor.institutionDepartment of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong, Hong Kongen
dc.contributor.institutionProject ALICE, INRIA/LORIA, Campus Scientifique, 615, rue du Jardin Botanique, 54600, Villers les Nancy, Franceen
dc.contributor.institutionMicrosoft Research Asia, Building 2, No. 5 Danling Street, Haidian District, Beijing 100800, Chinaen
kaust.authorYan, Dongmingen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.