File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A new algorithm for fast updating Delaunay triangulation of moving points based on local fixing

TitleA new algorithm for fast updating Delaunay triangulation of moving points based on local fixing
Authors
Zhou, YSun, FWang, WWang, JZhang, C
KeywordsBi-Cell
Delaunay Triangulation
Filtering
Reverse Fixing
Issue Date2011
Citation
Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal Of Computer-Aided Design And Computer Graphics, 2011, v. 23 n. 12, p. 2006-2012 How to Cite?
AbstractFor updating a Delaunay triangulation of moving points, bi-cell filtering method can find the most bi-cells whose Delaunay connectivities remain unchanged after the points are slightly perturbed. When flipped bi-cells occur, rebuilding method for all points has to be applied. In this paper, we present a new algorithm that improves the performance of the original bi-cell filtering algorithm via checking and fixing flipped bi-cells locally. Experimental results show that the new algorithm runs 20% to 30% faster than the original algorithm when rebuilding method is applied frequently.
Persistent Identifierhttp://hdl.handle.net/10722/152483
ISSN
1003-9775
2023 SCImago Journal Rankings: 0.161
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorZhou, Yen_US
dc.contributor.authorSun, Fen_US
dc.contributor.authorWang, Wen_US
dc.contributor.authorWang, Jen_US
dc.contributor.authorZhang, Cen_US
dc.date.accessioned2012-06-26T06:39:33Z-
dc.date.available2012-06-26T06:39:33Z-
dc.date.issued2011en_US
dc.identifier.citationJisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal Of Computer-Aided Design And Computer Graphics, 2011, v. 23 n. 12, p. 2006-2012en_US
dc.identifier.issn1003-9775en_US
dc.identifier.urihttp://hdl.handle.net/10722/152483-
dc.description.abstractFor updating a Delaunay triangulation of moving points, bi-cell filtering method can find the most bi-cells whose Delaunay connectivities remain unchanged after the points are slightly perturbed. When flipped bi-cells occur, rebuilding method for all points has to be applied. In this paper, we present a new algorithm that improves the performance of the original bi-cell filtering algorithm via checking and fixing flipped bi-cells locally. Experimental results show that the new algorithm runs 20% to 30% faster than the original algorithm when rebuilding method is applied frequently.en_US
dc.languageengen_US
dc.relation.ispartofJisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphicsen_US
dc.subjectBi-Cellen_US
dc.subjectDelaunay Triangulationen_US
dc.subjectFilteringen_US
dc.subjectReverse Fixingen_US
dc.titleA new algorithm for fast updating Delaunay triangulation of moving points based on local fixingen_US
dc.typeArticleen_US
dc.identifier.emailWang, W:wenping@cs.hku.hken_US
dc.identifier.authorityWang, W=rp00186en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-83055195384en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-83055195384&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume23en_US
dc.identifier.issue12en_US
dc.identifier.spage2006en_US
dc.identifier.epage2012en_US
dc.identifier.scopusauthoridZhou, Y=36653476300en_US
dc.identifier.scopusauthoridSun, F=35068615100en_US
dc.identifier.scopusauthoridWang, W=35147101600en_US
dc.identifier.scopusauthoridWang, J=36653339300en_US
dc.identifier.scopusauthoridZhang, C=35197623400en_US
dc.identifier.issnl1003-9775-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats