Title
Surface remeshing in arbitrary codimensions
Abstract
We present a method for remeshing surfaces that is both general and efficient. Existing efficient methods are restrictive in the type of remeshings they produce, while methods that are able to produce general types of remeshings are generally based on iteration, which prevents them from producing remeshes at interactive rates. In our method, the input surface is directly mapped to an arbitrary (possibly high-dimensional) range space, and uniformly remeshed in this space. Because the mesh is uniform in the range space, all the quantities encoded in the mapping are bounded, resulting in a mesh that is simultaneously adapted to all criteria encoded in the map, and thus we can obtain remeshings of arbitrary characteristics. Because the core operation is a uniform remeshing of a surface embedded in range space, and this operation is direct and local, this remeshing is efficient and can run at interactive rates.
Year
DOI
Venue
2006
10.1007/s00371-006-0073-8
The Visual Computer
Keywords
Field
DocType
general type,core operation,arbitrary characteristic,arbitrary codimensions,uniform remeshing,efficient method,geometric algorithms · surface · remeshing · approximation,remeshing surface,range space,interactive rate,input surface,surface,approximation
Mathematical optimization,Computer science,Bounded function
Journal
Volume
Issue
ISSN
22
9
1432-2315
Citations 
PageRank 
References 
10
0.56
25
Authors
2
Name
Order
Citations
PageRank
Guillermo D. Cañas1554.74
Steven J. Gortler24205366.17