File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Isotropic remeshing with fast and exact computation of restricted voronoi diagram

TitleIsotropic remeshing with fast and exact computation of restricted voronoi diagram
Authors
KeywordsI.3.3 [Computer Graphics]
Picture/Image Generation - Line and curve generation
Issue Date2009
PublisherBlackwell 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?
AbstractWe 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 Identifierhttp://hdl.handle.net/10722/60606
ISSN
2015 Impact Factor: 1.542
2015 SCImago Journal Rankings: 0.960
References

 

DC FieldValueLanguage
dc.contributor.authorYan, DMen_HK
dc.contributor.authorLévy, Ben_HK
dc.contributor.authorLiu, Yen_HK
dc.contributor.authorSun, Fen_HK
dc.contributor.authorWang, Wen_HK
dc.date.accessioned2010-05-31T04:14:51Z-
dc.date.available2010-05-31T04:14:51Z-
dc.date.issued2009en_HK
dc.identifier.citationComputer Graphics Forum, 2009, v. 28 n. 5, p. 1445-1454en_HK
dc.identifier.issn0167-7055en_HK
dc.identifier.urihttp://hdl.handle.net/10722/60606-
dc.description.abstractWe 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.languageengen_HK
dc.publisherBlackwell Publishing Ltd. The Journal's web site is located at http://www.blackwellpublishing.com/journals/CGFen_HK
dc.relation.ispartofComputer Graphics Forumen_HK
dc.rightsComputer Graphics Forum: the international journal of the Eurographics Association. Copyright © Blackwell Publishing Ltd.-
dc.subjectI.3.3 [Computer Graphics]en_HK
dc.subjectPicture/Image Generation - Line and curve generationen_HK
dc.titleIsotropic remeshing with fast and exact computation of restricted voronoi diagramen_HK
dc.typeArticleen_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.1111/j.1467-8659.2009.01521.xen_HK
dc.identifier.scopuseid_2-s2.0-70049102714en_HK
dc.identifier.hkuros161782en_HK
dc.identifier.hkuros166493-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-70049102714&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume28en_HK
dc.identifier.issue5en_HK
dc.identifier.spage1445en_HK
dc.identifier.epage1454en_HK
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridYan, DM=14825994000en_HK
dc.identifier.scopusauthoridLévy, B=35264760300en_HK
dc.identifier.scopusauthoridLiu, Y=36065585300en_HK
dc.identifier.scopusauthoridSun, F=7401804124en_HK
dc.identifier.scopusauthoridWang, W=35147101600en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats