#### DMCA

## Subdivision Tree Representation of Arbitrary Triangle Meshes (1998)

Citations: | 1 - 1 self |

### Citations

168 | Progressive simplicial complexes
- Popović, Hoppe
- 1997
(Show Context)
Citation Context ...a limited number previously appearing vertices stored in a buer [3]. The BT rate is about 1 16 log 2 n + 4 (BT). PM in [6] uses about 1 2 log 2 n + 2:5 (BT) for topological coding. And modied PM in =-=[11]-=- uses 1 2 log 2 n+ 3:5(BT). Li's method [9] has an average BT rate of 1 2 log 2 n+ 4:5 (BT). We notice that all coding schemes above have a term log 2 n in their BT rates. The reason is that they acce... |

126 | Optimizing triangle strips for fast rendering
- Evans, Skiena, et al.
- 1996
(Show Context)
Citation Context ...hics and other application areas. One problem in dealing with meshes is to store topological information or connectivity of meshes. Recently, some methods have been presented to eciently code meshes =-=[5, 3, 4, 13, 6, 9]-=-. A recent survey can be found in [12]. A triangle mesh has two dierent parts: topological information and geometric information. The topological information (also called connectivity) is about the r... |

110 |
Optimized geometry compression for real-time rendering
- Chow
- 1997
(Show Context)
Citation Context ...n, except some special cases such as regular grid, or Delaunay Triangulations, where geometric information is able to determine connectivity. Most current methods try to generate long triangle strips =-=[5, 3, 13, 1]-=- to code mesh connectivity so that they can be used in some graphical library such as OpenGL. Some methods use vertex split/merge to code topological information implicitely [6, 9]. The hierarchical t... |

100 | Hierarchical triangulation for multiresolution surface description geometric design
- Floriani, Puppo
- 1995
(Show Context)
Citation Context ...hics and other application areas. One problem in dealing with meshes is to store topological information or connectivity of meshes. Recently, some methods have been presented to eciently code meshes =-=[5, 3, 4, 13, 6, 9]-=-. A recent survey can be found in [12]. A triangle mesh has two dierent parts: topological information and geometric information. The topological information (also called connectivity) is about the r... |

43 |
Geometry Compression through Topological Surgery
- Taubin, Rossignac
- 1998
(Show Context)
Citation Context ...hics and other application areas. One problem in dealing with meshes is to store topological information or connectivity of meshes. Recently, some methods have been presented to eciently code meshes =-=[5, 3, 4, 13, 6, 9]-=-. A recent survey can be found in [12]. A triangle mesh has two dierent parts: topological information and geometric information. The topological information (also called connectivity) is about the r... |

35 |
Topology of Surfaces.
- Kinsey
- 1993
(Show Context)
Citation Context ...n their general forms, although we are only interested in orientable bounded 2surfaces in R 3 . For details about these terms and related information, readers may refer to topology textbooks, such as =-=[8]-=-. Denition 1 The Euclidean distance between x = (x 1 ; :::; x n ) and y = (y 1 ; :::; y n ) in R n is given by kx yk = q (x 1 y 1 ) 2 + :::+ (x n y n ) 2 Denition 2 A topological space is a set... |

17 | Progressive Compression of 3D Graphics Models
- Li, Li, et al.
- 1997
(Show Context)
Citation Context |

14 | View-dependent re of progressive meshes - Hoppe - 1997 |

1 |
Geometric Simpli and Compression
- Rossignac
(Show Context)
Citation Context ...ing with meshes is to store topological information or connectivity of meshes. Recently, some methods have been presented to eciently code meshes [5, 3, 4, 13, 6, 9]. A recent survey can be found in =-=[12]-=-. A triangle mesh has two dierent parts: topological information and geometric information. The topological information (also called connectivity) is about the relationship between vertices, edges an... |