Resampling Strategies for Deforming MLS Surfaces

Simple item page
dc.contributor.authorGois, Joao Pauloen_US
dc.contributor.authorBuscaglia, Gustavo C.en_US
dc.date.accessioned2015-02-23T09:40:44Z
dc.date.available2015-02-23T09:40:44Z
dc.date.issued2010en_US
dc.description.abstractMoving-least-squares (MLS) surfaces undergoing large deformations need periodic regeneration of the point set (point-set resampling) so as to keep the point-set density quasi-uniform. Previous work by the authors dealt with algebraic MLS surfaces, and proposed a resampling strategy based on defining the new points at the intersections of the MLS surface with a suitable set of rays. That strategy has very low memory requirements and is easy to parallelize. In this article new resampling strategies with reduced CPU-time cost are explored. The basic idea is to choose as set of rays the lines of a regular, Cartesian grid, and to fully exploit this grid: as data structure for search queries, as spatial structure for traversing the surface in a continuation-like algorithm, and also as approximation grid for an interpolated version of the MLS surface. It is shown that in this way a very simple and compact resampling technique is obtained, which cuts the resampling cost by half with affordable memory requirements.en_US
dc.description.number6en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume29en_US
dc.identifier.doi10.1111/j.1467-8659.2010.01663.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages1969-1980en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2010.01663.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleResampling Strategies for Deforming MLS Surfacesen_US
Files
Collections
29-Issue 6