TY - GEN
T1 - Geometry images
AU - Gu, Xianfeng
AU - Gortler, Steven J.
AU - Hoppe, Hugues
PY - 2002
Y1 - 2002
N2 - 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.
AB - 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.
KW - remeshing
KW - surface parametrization
UR - https://www.scopus.com/pages/publications/77953832091
U2 - 10.1145/566570.566589
DO - 10.1145/566570.566589
M3 - Conference contribution
AN - SCOPUS:77953832091
SN - 1581135211
SN - 9781581135213
T3 - Proceedings of the 29th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH '02
SP - 355
EP - 361
BT - Proceedings of the 29th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH '02
T2 - 29th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH '02
Y2 - 23 July 2002 through 26 July 2002
ER -