Geometry images

DMCA

Geometry images (2002)

Cached

Download Links

by Xianfeng Gu , Steven J. Gortler , Hugues Hoppe

Venue:	IN PROC. 29TH SIGGRAPH
Citations:	342 - 24 self

BibTeX

@INPROCEEDINGS{Gu02geometryimages,
    author = {Xianfeng Gu and Steven J. Gortler and Hugues Hoppe},
    title = { Geometry images},
    booktitle = {IN PROC. 29TH SIGGRAPH },
    year = {2002},
    pages = {355--361},
    publisher = {}
}

OpenURL

Abstract

Surface geometry is often modeled with irregular triangle meshes. The process of remeshing refers to approximating such geometry using a mesh with (semi)-regular connectivity, which has advantages for many graphics applications. However, current techniques for remeshing arbitrary surfaces create only semi-regular meshes. The original mesh is typically decomposed into a set of disk-like charts, onto which the geometry is parametrized and sampled. In this paper, we propose to remesh an arbitrary surface onto a completely regular structure we call a geometry image. It captures geometry as a simple 2D array of quantized points. Surface signals like normals and colors are stored in similar 2D arrays using the same implicit surface parametrization — texture coordinates are absent. To create a geometry image, we cut an arbitrary mesh along a network of edge paths, and parametrize the resulting single chart onto a square. Geometry images can be encoded using traditional image compression algorithms, such as wavelet-based coders.

Keyphrases

geometry image arbitrary surface regular structure arbitrary mesh original mesh semi-regular mesh traditional image compression current technique irregular triangle mesh edge path surface signal implicit surface parametrization texture coordinate regular connectivity many graphic application single chart quantized point surface geometry wavelet-based coder disk-like chart