File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Efficient computation of clipped Voronoi diagram for mesh generation

TitleEfficient computation of clipped Voronoi diagram for mesh generation
Authors
KeywordsCentroidal Voronoi Tessellation
Clipped Voronoi Diagram
Delaunay Triangulation
Mesh Generation
Issue Date2013
PublisherElsevier Ltd. The Journal's web site is located at http://www.elsevier.com/locate/cad
Citation
Cad Computer Aided Design, 2013, v. 45 n. 4, p. 843-852 How to Cite?
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.
Persistent Identifierhttp://hdl.handle.net/10722/152470
ISSN
2015 Impact Factor: 2.149
2015 SCImago Journal Rankings: 1.078
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorYan, DMen_US
dc.contributor.authorWang, Wen_US
dc.contributor.authorLévy, Ben_US
dc.contributor.authorLiu, Yen_US
dc.date.accessioned2012-06-26T06:39:28Z-
dc.date.available2012-06-26T06:39:28Z-
dc.date.issued2013en_US
dc.identifier.citationCad Computer Aided Design, 2013, v. 45 n. 4, p. 843-852en_US
dc.identifier.issn0010-4485en_US
dc.identifier.urihttp://hdl.handle.net/10722/152470-
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.en_US
dc.languageengen_US
dc.publisherElsevier Ltd. The Journal's web site is located at http://www.elsevier.com/locate/caden_US
dc.relation.ispartofCAD Computer Aided Designen_US
dc.subjectCentroidal Voronoi Tessellationen_US
dc.subjectClipped Voronoi Diagramen_US
dc.subjectDelaunay Triangulationen_US
dc.subjectMesh Generationen_US
dc.titleEfficient computation of clipped Voronoi diagram for mesh generationen_US
dc.typeArticleen_US
dc.identifier.emailWang, W:wenping@cs.hku.hken_US
dc.identifier.authorityWang, W=rp00186en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1016/j.cad.2011.09.004en_US
dc.identifier.scopuseid_2-s2.0-84875949865en_US
dc.identifier.hkuros208993-
dc.identifier.hkuros225490-
dc.identifier.isiWOS:000317454700005-
dc.publisher.placeUnited Kingdomen_US
dc.identifier.scopusauthoridYan, DM=14825994000en_US
dc.identifier.scopusauthoridWang, W=35147101600en_US
dc.identifier.scopusauthoridLévy, B=35264760300en_US
dc.identifier.scopusauthoridLiu, Y=53164093800en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats