File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-642-13411-1_18
- Scopus: eid_2-s2.0-77954636481
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Efficient computation of 3D clipped Voronoi diagram
Title | Efficient computation of 3D clipped Voronoi diagram |
---|---|
Authors | |
Keywords | Centroidal Voronoi tessellation Delaunay triangulation Tetrahedral meshing Voronoi diagram |
Issue Date | 2010 |
Publisher | Springer 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? |
Abstract | The 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. |
Description | LNCS v. 6130 is proceedings of the 6th International Conference, GMP 2010 |
Persistent Identifier | http://hdl.handle.net/10722/132187 |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yan, DM | en_HK |
dc.contributor.author | Wang, W | en_HK |
dc.contributor.author | Lévy, B | en_HK |
dc.contributor.author | Liu, Y | en_HK |
dc.date.accessioned | 2011-03-21T09:00:04Z | - |
dc.date.available | 2011-03-21T09:00:04Z | - |
dc.date.issued | 2010 | en_HK |
dc.identifier.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 | en_HK |
dc.identifier.issn | 0302-9743 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/132187 | - |
dc.description | LNCS v. 6130 is proceedings of the 6th International Conference, GMP 2010 | - |
dc.description.abstract | The 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.language | eng | en_US |
dc.publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ | en_HK |
dc.relation.ispartof | Lecture Notes in Computer Science | en_HK |
dc.rights | The original publication is available at www.springerlink.com | en_US |
dc.subject | Centroidal Voronoi tessellation | en_HK |
dc.subject | Delaunay triangulation | en_HK |
dc.subject | Tetrahedral meshing | en_HK |
dc.subject | Voronoi diagram | en_HK |
dc.title | Efficient computation of 3D clipped Voronoi diagram | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Wang, W:wenping@cs.hku.hk | en_HK |
dc.identifier.authority | Wang, W=rp00186 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/978-3-642-13411-1_18 | en_HK |
dc.identifier.scopus | eid_2-s2.0-77954636481 | en_HK |
dc.identifier.hkuros | 177891 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-77954636481&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 6130 | en_HK |
dc.identifier.spage | 269 | en_HK |
dc.identifier.epage | 282 | en_HK |
dc.publisher.place | Germany | en_HK |
dc.description.other | 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 | - |
dc.identifier.scopusauthorid | Yan, DM=14825994000 | en_HK |
dc.identifier.scopusauthorid | Wang, W=35147101600 | en_HK |
dc.identifier.scopusauthorid | Lévy, B=35264760300 | en_HK |
dc.identifier.scopusauthorid | Liu, Y=36065585300 | en_HK |
dc.identifier.issnl | 0302-9743 | - |