Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
MAPS: multiresolution adaptive parameterization of surfaces
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Feature sensitive surface extraction from volume data
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Texture mapping progressive meshes
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Dual contouring of hermite data
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Least squares conformal maps for automatic texture atlas generation
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Volume warping for adaptive isosurface extraction
Proceedings of the conference on Visualization '02
Spherical parametrization and remeshing
ACM SIGGRAPH 2003 Papers
ACM SIGGRAPH 2003 Papers
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Approximation of surfaces by normal meshes
Approximation of surfaces by normal meshes
Unconstrained spherical parameterization
SIGGRAPH '05 ACM SIGGRAPH 2005 Sketches
Rectangular multi-chart geometry images
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Mesh parameterization methods and their applications
Foundations and Trends® in Computer Graphics and Vision
EGSR'04 Proceedings of the Fifteenth Eurographics conference on Rendering Techniques
Hi-index | 0.01 |
A geometry image offers a simple and compact way of encoding the geometry of a surface and its implicit connectivity in an image-like data structure. It has been shown to be useful in multiple applications because of its suitability for efficient hardware rendering, level of detail, filtering, etc. Most existing algorithms generate geometry images by parameterizing the surface onto a domain, and by performing a regular resampling in this domain. Unfortunately, this regular resampling fails to capture sharp features present on the surface. In this paper, we propose to slightly alter the grid to align sample positions with corners and sharp edges in the geometric model. While doing so, our goal is to maintain the resulting geometry images simple to interpret, while producing higher quality reconstructions. We demonstrate an implementation in the planar domain and show results on a range of common geometrical models.