File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Efficient computation of 3D clipped Voronoi diagram

TitleEfficient computation of 3D clipped Voronoi diagram
Authors
KeywordsCentroidal Voronoi tessellation
Delaunay triangulation
Tetrahedral meshing
Voronoi diagram
Issue Date2010
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
The 6th International Conference of Geometric Modeling & Processing (GMP 2010), Casto Urdiales, Spain, 16-18 June 2010. In Lecture Notes in Computer Science, 2010, v. 6130, p. 269-282 How to Cite?
AbstractThe 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. © 2010 Springer-Verlag.
DescriptionLNCS v. 6130 is proceedings of the 6th International Conference, GMP 2010
Persistent Identifierhttp://hdl.handle.net/10722/132187
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252
References

 

DC FieldValueLanguage
dc.contributor.authorYan, DMen_HK
dc.contributor.authorWang, Wen_HK
dc.contributor.authorLévy, Ben_HK
dc.contributor.authorLiu, Yen_HK
dc.date.accessioned2011-03-21T09:00:04Z-
dc.date.available2011-03-21T09:00:04Z-
dc.date.issued2010en_HK
dc.identifier.citationThe 6th International Conference of Geometric Modeling & Processing (GMP 2010), Casto Urdiales, Spain, 16-18 June 2010. In Lecture Notes in Computer Science, 2010, v. 6130, p. 269-282en_HK
dc.identifier.issn0302-9743en_HK
dc.identifier.urihttp://hdl.handle.net/10722/132187-
dc.descriptionLNCS v. 6130 is proceedings of the 6th International Conference, GMP 2010-
dc.description.abstractThe 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. © 2010 Springer-Verlag.en_HK
dc.languageengen_US
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_HK
dc.relation.ispartofLecture Notes in Computer Scienceen_HK
dc.rightsThe original publication is available at www.springerlink.comen_US
dc.subjectCentroidal Voronoi tessellationen_HK
dc.subjectDelaunay triangulationen_HK
dc.subjectTetrahedral meshingen_HK
dc.subjectVoronoi diagramen_HK
dc.titleEfficient computation of 3D clipped Voronoi diagramen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailWang, W:wenping@cs.hku.hken_HK
dc.identifier.authorityWang, W=rp00186en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/978-3-642-13411-1_18en_HK
dc.identifier.scopuseid_2-s2.0-77954636481en_HK
dc.identifier.hkuros177891en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-77954636481&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume6130en_HK
dc.identifier.spage269en_HK
dc.identifier.epage282en_HK
dc.publisher.placeGermanyen_HK
dc.description.otherThe 6th International Conference of Geometric Modeling & Processing (GMP 2010), Casto Urdiales, Spain, 16-18 June 2010. In Lecture Notes in Computer Science, 2010, v. 6130, p. 269-282-
dc.identifier.scopusauthoridYan, DM=14825994000en_HK
dc.identifier.scopusauthoridWang, W=35147101600en_HK
dc.identifier.scopusauthoridLévy, B=35264760300en_HK
dc.identifier.scopusauthoridLiu, Y=36065585300en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats