Geometry Images

Xianfeng Gu  Steven J. Gortler Hugues Hoppe

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 advan-tages for many graphics applications. However, current techniques for remeshing arbitrary surfaces create onlysemi-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 acom-pletely 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.

 

ref:http://hhoppe.com/gim.pdf

http://users.csc.calpoly.edu/~zwood/teaching/csc570/final07/dalum_gzipkin/

This pseudocode summarizes our algorithm: [Hoppe]

function Cut(mesh M)
Remove seed triangle.
while there remains an edge e adjacent to only one triangle t
Remove e and t.
while there remains a vertex v adjacent to only one edge e
Remove v and e.
Cut p := remaining edges and vertices.
if only a single vertex remains in p then
Add back two adjacent edges to p.

User Guide

 

Mouse Usage:

 

Right click to access menu.
Left click and drag to translate, rotate, and scale mesh or light.

 

Keyboard Commands:

 

A: Watch cutting algorithm part 1
S: Watch cutting algorithm part 2
D: Watch reconstruction algorithm
F: Turn on culling
NUMPAD: Move culling box (4, 6 - X directions; 8, 2 - Y directions; 9, 3 - Z directions)
E: Show reconstructed mesh edges
<: Move camera backward
>: Move camera forward
SPACEBAR: Step through current algorithm manually
Q: Exit program