Fast Updating of Delaunay Triangulation of Moving Points by Bi-cell Filtering

Simple item page
dc.contributor.authorZhou, Yuanfengen_US
dc.contributor.authorSun, Fengen_US
dc.contributor.authorWang, Wenpingen_US
dc.contributor.authorWang, Jiayeen_US
dc.contributor.authorZhang, Caimingen_US
dc.date.accessioned2015-02-23T17:37:55Z
dc.date.available2015-02-23T17:37:55Z
dc.date.issued2010en_US
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.en_US
dc.description.number7en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume29en_US
dc.identifier.doi10.1111/j.1467-8659.2010.01812.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages2233-2242en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2010.01812.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleFast Updating of Delaunay Triangulation of Moving Points by Bi-cell Filteringen_US
Files
Collections
29-Issue 7