File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1111/j.1467-8659.2009.01521.x
- Scopus: eid_2-s2.0-70049102714
- WOS: WOS:000268597500020
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Isotropic remeshing with fast and exact computation of restricted voronoi diagram
Title | Isotropic remeshing with fast and exact computation of restricted voronoi diagram |
---|---|
Authors | |
Keywords | I.3.3 [Computer Graphics] Picture/Image Generation - Line and curve generation |
Issue Date | 2009 |
Publisher | Blackwell Publishing Ltd. The Journal's web site is located at http://www.blackwellpublishing.com/journals/CGF |
Citation | Computer Graphics Forum, 2009, v. 28 n. 5, p. 1445-1454 How to Cite? |
Abstract | We propose a new isotropic remeshing method, based on Centroidal Voronoi Tessellation (CVT). Constructing CVT requires to repeatedly compute Restricted Voronoi Diagram (RVD), defined as the intersection between a 3D Voronoi diagram and an input mesh surface. Existing methods use some approximations of RVD. In this paper, we introduce an efficient algorithm that computes RVD exactly and robustly. As a consequence, we achieve better remeshing quality than approximation-based approaches, without sacrificing efficiency. Our method for RVD computation uses a simple procedure and a kd-tree to quickly identify and compute the intersection of each triangle face with its incident Voronoi cells. Its time complexity is O(mlog n), where n is the number of seed points and m is the number of triangles of the input mesh. Fast convergence of CVT is achieved using a quasi-Newton method, which proved much faster than Lloyd's iteration. Examples are presented to demonstrate the better quality of remeshing results with our method than with the state-of-art approaches. © 2009 The Eurographics Association and Blackwell Publishing Ltd. |
Persistent Identifier | http://hdl.handle.net/10722/60606 |
ISSN | 2023 Impact Factor: 2.7 2023 SCImago Journal Rankings: 1.968 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yan, DM | en_HK |
dc.contributor.author | Lévy, B | en_HK |
dc.contributor.author | Liu, Y | en_HK |
dc.contributor.author | Sun, F | en_HK |
dc.contributor.author | Wang, W | en_HK |
dc.date.accessioned | 2010-05-31T04:14:51Z | - |
dc.date.available | 2010-05-31T04:14:51Z | - |
dc.date.issued | 2009 | en_HK |
dc.identifier.citation | Computer Graphics Forum, 2009, v. 28 n. 5, p. 1445-1454 | en_HK |
dc.identifier.issn | 0167-7055 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/60606 | - |
dc.description.abstract | We propose a new isotropic remeshing method, based on Centroidal Voronoi Tessellation (CVT). Constructing CVT requires to repeatedly compute Restricted Voronoi Diagram (RVD), defined as the intersection between a 3D Voronoi diagram and an input mesh surface. Existing methods use some approximations of RVD. In this paper, we introduce an efficient algorithm that computes RVD exactly and robustly. As a consequence, we achieve better remeshing quality than approximation-based approaches, without sacrificing efficiency. Our method for RVD computation uses a simple procedure and a kd-tree to quickly identify and compute the intersection of each triangle face with its incident Voronoi cells. Its time complexity is O(mlog n), where n is the number of seed points and m is the number of triangles of the input mesh. Fast convergence of CVT is achieved using a quasi-Newton method, which proved much faster than Lloyd's iteration. Examples are presented to demonstrate the better quality of remeshing results with our method than with the state-of-art approaches. © 2009 The Eurographics Association and Blackwell Publishing Ltd. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Blackwell Publishing Ltd. The Journal's web site is located at http://www.blackwellpublishing.com/journals/CGF | en_HK |
dc.relation.ispartof | Computer Graphics Forum | en_HK |
dc.rights | Computer Graphics Forum: the international journal of the Eurographics Association. Copyright © Blackwell Publishing Ltd. | - |
dc.subject | I.3.3 [Computer Graphics] | en_HK |
dc.subject | Picture/Image Generation - Line and curve generation | en_HK |
dc.title | Isotropic remeshing with fast and exact computation of restricted voronoi diagram | en_HK |
dc.type | Article | 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.1111/j.1467-8659.2009.01521.x | en_HK |
dc.identifier.scopus | eid_2-s2.0-70049102714 | en_HK |
dc.identifier.hkuros | 161782 | en_HK |
dc.identifier.hkuros | 166493 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-70049102714&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 28 | en_HK |
dc.identifier.issue | 5 | en_HK |
dc.identifier.spage | 1445 | en_HK |
dc.identifier.epage | 1454 | en_HK |
dc.identifier.isi | WOS:000268597500020 | - |
dc.publisher.place | United Kingdom | en_HK |
dc.identifier.scopusauthorid | Yan, DM=14825994000 | en_HK |
dc.identifier.scopusauthorid | Lévy, B=35264760300 | en_HK |
dc.identifier.scopusauthorid | Liu, Y=36065585300 | en_HK |
dc.identifier.scopusauthorid | Sun, F=7401804124 | en_HK |
dc.identifier.scopusauthorid | Wang, W=35147101600 | en_HK |
dc.identifier.issnl | 0167-7055 | - |