File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Fast updating of delaunay triangulation of moving points by bi-cell filtering

TitleFast updating of delaunay triangulation of moving points by bi-cell filtering
Authors
Zhou, YSun, FWang, WWang, JZhang, C
KeywordsI.3.5 [Computer Graphics]: Computational Geometry and Object Modeling - Geometric algorithms, languages, and systems
Issue Date2010
PublisherBlackwell Publishing Ltd. The Journal's web site is located at http://www.blackwellpublishing.com/journals/CGF
Citation
Computer Graphics Forum, 2010, v. 29 n. 7, p. 2233-2242 How to Cite?
DOI: http://dx.doi.org/10.1111/j.1467-8659.2010.01812.x
AbstractUpdating a Delaunay triangulation when data points are slightly moved is the bottleneck of computation time in variational methods for mesh generation and remeshing. Utilizing the connectivity coherence between two consecutive Delaunay triangulations for computation speedup is the key to solving this problem. Our contribution is an effective filtering technique that confirms most bi-cells whose Delaunay connectivities remain unchanged after the points are perturbed. Based on bi-cell flipping, we present an efficient algorithm for updating two-dimensional and three-dimensional Delaunay triangulations of dynamic point sets. Experimental results show that our algorithm outperforms previous methods. © 2010 The Eurographics Association and Blackwell Publishing Ltd.
Persistent Identifierhttp://hdl.handle.net/10722/134618
ISSN
0167-7055
2023 Impact Factor: 2.7
2023 SCImago Journal Rankings: 1.968
ISI Accession Number ID
WOS:000283159400026
Funding AgencyGrant Number
Research Grant Council of Hong Kong718209
718010
National Basic Research Program of China(973 Program)2006CB303102
NSFC60933008
National 863 High-Tech Program of China2009AA01Z304
Funding Information:

We thank AIM@SHAPE Project [Aim] for kindly providing three-dimensional models used in this paper. We would like to thank Pedro Machado for providing the code of vertex filtering algorithm. We thank Dong-ming Yan for the mesh generation and remeshing programs and many helpful discussions during this work. We also thank the reviewers for constructive and detailed comments. The work of W. Wang is partially supported by the Research Grant Council of Hong Kong (project no.: 718209 and 718010). The work of C. Zhang is partially supported by the National Basic Research Program of China(973 Program) (2006CB303102), the State Key Program of NSFC project (60933008), and the National 863 High-Tech Program of China (2009AA01Z304).

References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorZhou, Yen_HK
dc.contributor.authorSun, Fen_HK
dc.contributor.authorWang, Wen_HK
dc.contributor.authorWang, Jen_HK
dc.contributor.authorZhang, Cen_HK
dc.date.accessioned2011-06-28T04:52:47Z-
dc.date.available2011-06-28T04:52:47Z-
dc.date.issued2010en_HK
dc.identifier.citationComputer Graphics Forum, 2010, v. 29 n. 7, p. 2233-2242en_HK
dc.identifier.issn0167-7055en_HK
dc.identifier.urihttp://hdl.handle.net/10722/134618-
dc.description.abstractUpdating a Delaunay triangulation when data points are slightly moved is the bottleneck of computation time in variational methods for mesh generation and remeshing. Utilizing the connectivity coherence between two consecutive Delaunay triangulations for computation speedup is the key to solving this problem. Our contribution is an effective filtering technique that confirms most bi-cells whose Delaunay connectivities remain unchanged after the points are perturbed. Based on bi-cell flipping, we present an efficient algorithm for updating two-dimensional and three-dimensional Delaunay triangulations of dynamic point sets. Experimental results show that our algorithm outperforms previous methods. © 2010 The Eurographics Association and Blackwell Publishing Ltd.en_HK
dc.languageeng-
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.rightsThe definitive version is available at www.blackwell-synergy.com-
dc.subjectI.3.5 [Computer Graphics]: Computational Geometry and Object Modeling - Geometric algorithms, languages, and systems-
dc.titleFast updating of delaunay triangulation of moving points by bi-cell filteringen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0167-7055&volume=29&issue=7&spage=2233–2242&epage=&date=2010&atitle=Fast+updating+of+delaunay+triangulation+of+moving+points+by+bi-cell+filtering-
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.2010.01812.xen_HK
dc.identifier.scopuseid_2-s2.0-78249279354en_HK
dc.identifier.hkuros177898-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-78249279354&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume29en_HK
dc.identifier.issue7en_HK
dc.identifier.spage2233en_HK
dc.identifier.epage2242en_HK
dc.identifier.isiWOS:000283159400026-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridZhou, Y=36653476300en_HK
dc.identifier.scopusauthoridSun, F=35068615100en_HK
dc.identifier.scopusauthoridWang, W=35147101600en_HK
dc.identifier.scopusauthoridWang, J=36653339300en_HK
dc.identifier.scopusauthoridZhang, C=35197623400en_HK
dc.identifier.issnl0167-7055-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats