Geometry images

DSpace/Manakin Repository

Geometry images

Citable link to this page


Title: Geometry images
Author: Gortler, Steven; Gu, Xianfeng; Hoppe, Hugues

Note: Order does not necessarily reflect citation order of authors.

Citation: Gu, Xianfeng, Steven J. Gortler, and Hugues Hoppe. 2002. Geometry images. In Proceedings of ACM SIGGRAPH 2002, July 21-26, 2002, San Antonio, Texas. New York, N.Y.: Association for Computing Machinery. Also published as Proceedings of ACM SIGGRAPH 2002. Special Issue, ACM Transactions on Graphics 21(3): 355-361.
Full Text & Related Files:
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.
Published Version:
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at
Citable link to this page:
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)


Search DASH

Advanced Search