A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Edgebreaker on a Corner Table: A Simple Technique for Representing and Compressing Triangulated Surfaces
[chapter]

2003
*
Mathematics and Visualization
*

A triangulated surface S with V vertices is sometimes stored as a list of T independent triangles, each described by the 3 floating-point coordinates of its vertices. This representation requires about 576V bits and provides no explicit information regarding the adjacency between neighboring triangles or vertices. A variety of boundary-graph data structures may be derived from such a representation in order to make explicit the various adjacency and incidence relations between triangles, edges,

doi:10.1007/978-3-642-55787-3_3
fatcat:p52ord7g65g7bh66ldrlqlcx7i