## Hierarchyless simplification, stripification and compression of triangulated two-manifolds (2005)

### Cached

### Download Links

Venue: | COMPUT. GRAPH. FORUM |

Citations: | 3 - 3 self |

### BibTeX

@ARTICLE{Diaz-Gutierrez05hierarchylesssimplification,,

author = {Pablo Diaz-Gutierrez and M. Gopi and Renato Pajarola},

title = { Hierarchyless simplification, stripification and compression of triangulated two-manifolds},

journal = {COMPUT. GRAPH. FORUM},

year = {2005},

volume = {24},

pages = {457--467}

}

### OpenURL

### Abstract

In this paper we explore the algorithmic space in which stripification, simplification and geometric compression of triangulated 2-manifolds overlap. Edge-collapse/uncollapse based geometric simplification algorithms develop a hierarchy of collapses such that during uncollapse the reverse order has to be maintained. We show that restricting the simplification and refinement operations only to, what we call, the collapsible edges creates hierarchyless simplification in which the operations on one edge can be performed independent of those on another. Although only a restricted set of edges is used for simplification operations, we prove topological results to show that, with minor retriangulation, any triangulated 2-manifold can be reduced to either a single vertex or a single edge using the hierarchyless simplification, resulting in extreme simplification. The set of collapsible edges helps us analyze and relate the similarities between simplification, stripification and geometric compression algorithms. We show that the maximal set of collapsible edges implicitly describes a triangle strip representation of the original model. Further, these strips can be effortlessly maintained on multiresolution models obtained through any sequence of hierarchyless simplifications on these collapsible edges. Due to natural relationship between stripification and geometric compression, these multi-resolution models can also be efficiently compressed using traditional compression algorithms. We present algorithms to find the maximal set of collapsible edges and to reorganize these edges to get the minimum

### Citations

1113 | Progressive meshes - Hoppe - 1996 |

952 |
A method for the construction of minimum redundancy codes
- Huffman
- 1952
(Show Context)
Citation Context ...ation. Improved compression ratios can be achieved by combining the above basic coding scheme with patternor Entropy-based variable rate data compression techniques such as Lempel-Ziv [LZ78], Huffman =-=[Huf52]-=- orarithmetic coding [CNW87]. We report some initial results in Section 6 but further optimization of the encoding is beyond the scope of this paper and will be addressed by future extensions. As pres... |

947 | Surface simplification using quadric error metrics
- Garland, Heckbert
- 1997
(Show Context)
Citation Context ...e computed. the sum of the positions and the number of vertices independently. This enables weighted average calculation when two cycles are merged. In our implementation, we use accumulated quadrics =-=[GH97]-=- since we minimize the quadric error to find the position of the resulting collapsed vertex. The edge collapse and uncollapse operations using this data structure are described in Figure 5. 6. Impleme... |

735 | Compression of Individual Sequences via VariableRate Coding
- Ziv, Lempel
- 1978
(Show Context)
Citation Context ... further optimization. Improved compression ratios can be achieved by combining the above basic coding scheme with patternor Entropy-based variable rate data compression techniques such as Lempel-Ziv =-=[LZ78]-=-, Huffman [Huf52] orarithmetic coding [CNW87]. We report some initial results in Section 6 but further optimization of the encoding is beyond the scope of this paper and will be addressed by future ex... |

666 |
Arithmetic coding for data compression
- Witten, Neal, et al.
- 1987
(Show Context)
Citation Context ...ratios can be achieved by combining the above basic coding scheme with patternor Entropy-based variable rate data compression techniques such as Lempel-Ziv [LZ78], Huffman [Huf52] orarithmetic coding =-=[CNW87]-=-. We report some initial results in Section 6 but further optimization of the encoding is beyond the scope of this paper and will be addressed by future extensions. As presented, our encoding applies ... |

394 | View-Dependent Refinement of Progressive Meshes - HOPPE - 1997 |

354 | W.: Mesh optimization - HOPPE, DEROSE, et al. - 1993 |

323 | Skip Lists: A Probabilistic Alternative to Balanced Trees
- Pugh
- 1990
(Show Context)
Citation Context ...ght as much as possible while performing these merging operations. We assign a cost to each possible nodal vertex processing, triangle-split, and edge-swap operations and sort them in a priority list =-=[Pug90]-=-. This cost is given by the increase in the overall weight of the matched edges after a certain operation. The cost of a nodal vertex processing would be the difference between the sums of the weights... |

318 | Geometry compression - Deering - 1998 |

298 | Triangle Mesh Compression - Touma, Gotsman - 1998 |

249 | Geometric Compression through Topological Surgery
- Taubin, Rossignac
- 1998
(Show Context)
Citation Context ...triangle strip) mesh traversal and may thus lead to other extra costs. 4.2. Hand-and-Glove Mesh Compression 461 We now present a simple variant of a vertex-spanning tree based mesh encoding (see also =-=[TR98]-=-). The fundamental motivation for this algorithm is to encode the collapsible edge trees along with the connectivity between the trees, so that the compressed model can be viewed as the compression of... |

176 | W.: Real time compression of triangle mesh connectivity - GURNHOLD, STRASSER - 1998 |

168 | Simplifying surfaces with color and texture using quadric error metrics - Garland, Heckbert - 1998 |

163 | Dynamic view-dependent simplification for polygonal models - Xia, Varshney - 1996 |

138 | Fast and memory efficient polygonal simplification - Lindstrom, Turk - 1998 |

115 | Optimizing triangle strips for fast rendering - Evans, Skiena, et al. - 1996 |

114 | A survey of polygonal simplification algorithms - Luebke - 1997 |

103 | Valence-Driven Connectivity Encoding for 3D Meshes - Alliez, Desbrun |

96 | Optimized Geometry Compression for Real-time Rendering - Chow - 1997 |

57 | Generalized view-dependent simplification - El-Sana, Varshney - 1999 |

44 | External memory viewdependent simplification - El-Sana, CHIANG |

43 |
Near-optimal fully-dynamic graph connectivity
- Thorup
- 2000
(Show Context)
Citation Context ...planar graphs [BBDL01] or O(nlog 4 n) in general, where n is the number of input nodes in the dual graph; the latter bound can be further improved to O(nlog 3 nloglogn) using recent results of Thorup =-=[Tho00]-=-. Asimple example of a triangulation of a genus zero object and a set of collapsible edges is shown in Figure 2a. Weighted Perfect Matching High quality geometric simplification can be achieved only i... |

41 | Wrap&Zip decompression of the connectivity of triangle meshes compressed with Edgebreaker
- Rossignac, Szymczak
- 1999
(Show Context)
Citation Context ...Ise00]thatisbased on growing a connected mesh region from a start triangle and adding a single triangle at a time can be applied. Therefore, we could directly apply the Wrap&Zip compression technique =-=[RS99]-=- resulting in a guaranteed 1.7 bit per triangle encoding, or even smaller expected-case statistical coding. In fact, since we have a single triangle strip, the split code S in [RS99] can completely be... |

40 | and effective stripification of polygonal surface models - Xiang, Held, et al. - 1999 |

34 | Skip strips: maintaining triangle strips for view-dependent rendering - EL-SANA, AZANLI, et al. |

31 | FASTMESH: efficient view-dependent meshing - Pajarola - 2001 |

29 | Triangle strip compression, in
- Isenburg
- 2000
(Show Context)
Citation Context ...follows the same argumentation as in [Ros99, RS99]. The use of a simple Edgebreaker [Ros99] orWrap&Zip [RS99] code in conjunction with our single triangle-strip representation also compares well with =-=[Ise00]-=- that achieves similar connectivity encoding rates for encoding triangle strips. Valence driven mesh encoding techniques [TG98, AD01] provide some improvement in compression rates over the above refer... |

24 | Efficient algorithms for petersen’s matching theorem
- Biedl, Bose, et al.
(Show Context)
Citation Context ...two-manifold with arbitrary genus is maximally face-simplifiable. Further, such a collapsible edge set, in other words a perfect matching in the dual graph can be found in time O(n) for planar graphs =-=[BBDL01]-=- or O(nlog 4 n) in general, where n is the number of input nodes in the dual graph; the latter bound can be further improved to O(nlog 3 nloglogn) using recent results of Thorup [Tho00]. Asimple examp... |

24 | Xfastmesh: Fast view-dependent meshing from external memory - DeCoro, Pajarola - 2002 |

19 | Tunneling for triangle strips in continuous level-of-detail meshes - STEWART |

17 | Triangle mesh compression. Graphics Interface - Touma, Gotsman - 1998 |

15 | DStrips: dynamic triangle strips for real-time mash simplification and rendering - Shafae, Pajarola - 2003 |

13 |
H.: Arithmetic coding for data compression
- CLEARY, NEAL, et al.
- 1987
(Show Context)
Citation Context ...ratios can be achieved by combining the above basic coding scheme with patternor Entropy-based variable rate data compression techniques such as Lempel-Ziv [LZ78], Huffman [Huf52] orarithmetic coding =-=[CNW87]-=-. We report some initial results in Section 6 but further optimization of the encoding is beyond the scope of this paper and will be addressed by future extensions. As presented, our encoding applies ... |

11 | MANOCHA D.: Appearance-perserving simplification - COHEN, OLANO - 1998 |

11 | Edgebreaker: Compressing the incidence graph of triangle meshes
- ROSSIGNAC
- 1999
(Show Context)
Citation Context ...nly 4 opcodes, and hence a guaranteed 2 bit per triangle encoding can be used. Handling complex meshes with handles follows the same argumentation as in [Ros99, RS99]. The use of a simple Edgebreaker =-=[Ros99]-=- orWrap&Zip [RS99] code in conjunction with our single triangle-strip representation also compares well with [Ise00] that achieves similar connectivity encoding rates for encoding triangle strips. Val... |

10 | M.: Multiresolution triangle strips - BELMONTE, REMOLAR, et al. |

9 | Progressive Meshes", SIGGRAPH - Hoppe - 1996 |

8 |
Single strip triangulation of manifolds with arbitrary topology
- GOPI, EPPSTEIN
- 2004
(Show Context)
Citation Context ...ent (D). loops, the union of which covers all triangles of the mesh. An example of triangle strips defined by the collapsible edges is shown in Figure 2b. The stripification work by Gopi and Eppstein =-=[GE04]-=-, in fact, exploits the perfect matching algorithm to find the triangle strips. The collapsible edges form the ‘medial axes’ of triangle strip loops (refer Figure 2b). We use this property to do extre... |

8 | Fast and simple triangle strip generation - KORNMANN - 1999 |

8 | VARSHNEY A.: Skip Strips: Maintaining Triangle Strips for View-Dependent Rendering - EL-SANA, AZANLI |

7 | Controllable single-strip generation for triangulated surfaces - GOPI |

7 | Transitive mesh space of a progressive mesh
- Kim, Lee
(Show Context)
Citation Context ..., memory and speed efficient data structures [LT98, Paj01], dynamic viewdependent simplification [XV96, Hop97, ESV99], out-ofcore simplification [ESC00, DP02], selectively refining a simplified model =-=[KL03]-=-, and even multi-cost functions optimization for attribute preserving simplificac○ The Eurographics Association 2005. tion [COM98, GH98]. Similarly, there is a reasonable amount of literature for tria... |

3 |
C.: Die theorie der regularen graphs (The Theory of Regular Graphs
- PETERSON
(Show Context)
Citation Context ...node. A perfect matching M in G is a matching such that each node of G is incident to an edge in M. Forabridgeless graph in which every vertex has degree three, there always exists a perfect matching =-=[Pet91]-=-. In our case, we are interested in the dual graphs of triangulated two-manifolds; such graphs are bridgeless (in fact, 3-connected) and have degree three. A perfect matching in this dual graph will p... |

1 |
Edgebreaker 3D compression package
- SHIKHARE
(Show Context)
Citation Context ...his raw bit-stream reduces the cost down to about 1.5 bits per triangle as shown in Table 1. Thiscompares very well to other standard connectivity encodings such as an Edgebreaker implementation from =-=[Shi]-=- whichwealso followed by an arithmetic coding stage. Note that these experiments were performed on the meshes after joining connected components of collapsible edges and hence including the extra 3% t... |

1 | PAJAROLA R.: XFastMesh: Fast submitted to EUROGRAPHICS - DECORO |

1 | Geometry compression. SIGGRAPH - DEERING - 1995 |

1 | Triangle strip compression. Graphics Interface 2000 - ISENBURG |

1 | Edgebreaker 3D compression package. http://www.angelfire.com/space2/ dineshshikhare/compression/eb/index.html - SHIKHARE |