#### DMCA

## C-BDAM -- compressed batched dynamic adaptive meshes for terrain rendering (2006)

Venue: | COMPUTER GRAPHICS FORUM |

Citations: | 25 - 5 self |

### Citations

419 |
Universal codeword sets and representations of the integers
- Elias
- 1975
(Show Context)
Citation Context ...er than 2×2 in size. A single bit per split is used to encode the quadtree structure. At non-empty leaves, the coefficients are mapped to positive integers and encoded using a simple Elias gamma code =-=[Eli75]-=-, in which a positive integer x is represented by: 1+⌊log 2 x⌋ in unary (that is, ⌊log 2 x⌋ 0-bits followed by a 1-bit), followed by the binary representation of x without its most significant bit. Ou... |

290 | RealTime, continuous level of detail rendering of height fields - Lindstrom, Koller, et al. - 1996 |

283 | Roaming terrain: Real-time optimally adapting meshes - DUCHAINEAU, WOLINSKY, et al. - 1997 |

261 | Smooth View-Dependent Level-of-Detail Control and its Application to Terrain Rendering - Hoppe - 1998 |

144 | Geometry clipmaps: terrain rendering using nested regular grids
- Losasso, Hoppe
(Show Context)
Citation Context ...ut-of-core multiresolution data structures (e.g., BDAM [CGG∗03a], PBDAM [CGG∗03b], 4-8 tiling [HDJ05]) and in-core rendering from aggressively compressed pyramidal structures (e.g., Geometry Clipmaps =-=[LH04]-=-). The first set of methods is very efficient in approximating a planar or spherical terrain with the required accuracy and in incrementally communicating updates to the GPU as the viewer moves, but m... |

105 | Terrain Simplification Simplified: A General Framework for View-Dependent Out-of-Core Visualization - Lindstrom, Pascucci - 2002 |

103 | Nonlinear wavelet transforms for image coding via lifting
- Baraniuk, Davis, et al.
- 2003
(Show Context)
Citation Context ...d, while the vertices of the refined patches are placed at the centers of the square cells of the grid. To support compression, we recast diamond processing in the framework of wavelet update lifting =-=[JDSB03]-=-, with the purpose of transforming data into a domain with a sparser representation. In this framework, diamond coarsening is associated to wavelet analysis, while diamond refinement corresponds to wa... |

88 | P,Pascucci V. Visualization of Large Terrains Made Easy [C - Lindstrom |

82 | Recent advances in compression of 3D meshes
- Alliez, Gotsman
- 2005
(Show Context)
Citation Context ...ost of these cases the focus is on compression ratio rather than on the real-time view-dependent rendering from the compressed representation; for a recent survey of this field we refer the reader to =-=[AG05]-=-. 3. Batched Dynamic Adaptive Meshes The BDAM approach is a specialization of the more general Batched Multi-Triangulation framework [CGG∗05], and is based on the idea of moving the grain of the multi... |

80 | BDAM – Batched Dynamic Adaptive Meshes for high performance terrain visualization - Cignoni, Ganovelli, et al. |

73 | Building and traversing a surface at variable resolution - FLORIANI, MAGILLO, et al. - 1997 |

55 | Fast view-dependent level-of-detail rendering using cached geometry
- Levenberg
- 2002
(Show Context)
Citation Context ...ies. The first methods capable to producing adaptive conforming surfaces by composing precomputed patches with a low CPU cost, were explicitly designed for terrain rendering. RUSTIC [Pom00] and CABTT =-=[Lev02]-=- are extensions of the ROAM [DWS∗97] algorithm, in which subtrees of the ROAM bintree are cached and reused during rendering. A similar technique is also presented in [DP02] for generic meshes. BDAM [... |

45 | Planet-sized Batched Dynamic Adaptive Meshes (P-BDAM - Cignoni, Ganovelli, et al. - 2003 |

36 | Methods for user-based reduction of model complexity for virtual planetary exploration - Hitchner, McGreevy |

35 | Surface compression with geometric bandelets
- Peyré, Mallat
(Show Context)
Citation Context ...compressed terrain representations, which are typically at least one order of magnitude larger [LH04]. Handling discontinuities, e.g., through adaptive lifting [PH01] or a geometric bandelet approach =-=[PM05]-=-, is a promising avenue of future work. Adaptive rendering. The rendering tests were executed on a medium end single PC running Linux 2.6.15 with single AMD 1.8 GHz CPU, 2 GB of RAM, SATA 10000 RPM 15... |

31 | Batched multi triangulation - Cignoni, Ganovelli, et al. - 2005 |

27 | PAJAROLA R.: Xfastmesh: fast viewdependent meshing from external memory
- DECORO
- 2002
(Show Context)
Citation Context ... RUSTIC [Pom00] and CABTT [Lev02] are extensions of the ROAM [DWS∗97] algorithm, in which subtrees of the ROAM bintree are cached and reused during rendering. A similar technique is also presented in =-=[DP02]-=- for generic meshes. BDAM [CGG∗03a, CGG∗03b] constructs a forest of hierarchies of right triangles, where each node is a general triangulation of a small surface region, and explicitates the rules req... |

21 | Real-time optimal adaptation for planetary geometry and texture: 4-8 tile hierarchies
- Hwa, Duchaineau, et al.
(Show Context)
Citation Context ...g and rendering very large datasets are based on two approaches: adaptive coarse grained refinement from out-of-core multiresolution data structures (e.g., BDAM [CGG∗03a], PBDAM [CGG∗03b], 4-8 tiling =-=[HDJ05]-=-) and in-core rendering from aggressively compressed pyramidal structures (e.g., Geometry Clipmaps [LH04]). The first set of methods is very efficient in approximating a planar or spherical terrain wi... |

19 |
YCoCg-R: A Color Space with RGB Reversibility and Low Dynamic Range
- MALVAR, SULLIVAN
(Show Context)
Citation Context ... attributes. For the moment, we just support elevation, represented as a scalar value, and color, represented in input as a RGB triple. For color compression, we map colors to the YCoCg-R color space =-=[MS03]-=- to reduce correlation among components, and then compress each component separately. Normals are neither stored in the repository nor passed to the GPU, but directly computed on demand by finite diff... |

16 | Adaptive 4-8 texture hierarchies - Hwa, Duchaineau, et al. - 2004 |

16 |
ROAM Using Surface Triangle Clusters (RUSTiC
- Pomeranz
- 2000
(Show Context)
Citation Context ...itch block boundaries. The first methods capable to producing adaptive conforming surfaces by composing precomputed patches with a low CPU cost, were explicitly designed for terrain rendering. RUSTIC =-=[Pom00]-=- and CABTT [Lev02] are extensions of the ROAM [DWS∗97] algorithm, in which subtrees of the ROAM bintree are cached and reused during rendering. A similar technique is also presented in [DP02] for gene... |

14 | Scalable compression and rendering of textured terrain data - Wahl, Massing, et al. |

13 |
Sweldens, Wavelet families of increasing order in arbitrary dimensions
- Kovacevic, W
- 2000
(Show Context)
Citation Context ...on a constant weighting of αi j = 1 2 for all inner points. For prediction, we use a order 4 Neville interpolating filter if all support points fall inside the diamond, and a order 2 filter otherwise =-=[KS00]-=-. These filters predict points by a weighted sum of 12 (order 4) or 4 (order 2) coefficients, and are therefore very fast to compute (see figure 3). Figure 3: Neville filters. The filters predict poin... |

10 | scale terrain visualization using the restricted quadtree triangulation - Large - 1998 |

8 |
A wavelet-based two-stage near-lossless coder
- Yea, Pearlman
- 2006
(Show Context)
Citation Context ...tight bound on the maximum reconstruction error of each value, since it is difficult to derive meaningful relations between distortions in the wavelet domains and in the signal domain in the L∞ sense =-=[YP04]-=-. Using a L2 norm for general terrain management applications is hardly acceptable, since reconstruction errors are averaged over the entire domain and results suffer from high variance in the quality... |

3 |
Heijmans, “An adaptive update lifting scheme with perfect reconstruction
- Piella, M
- 2001
(Show Context)
Citation Context ...g and pure subsampling. To comply with BDAM diamond boundary constraints, it is sufficient to set αi j = 1 for all diamond boundary vertices. Even though weighting could be data dependent (see, e.g., =-=[PH01]-=-), for this paper we assume for speed and simplicity reason a constant weighting of αi j = 1 2 for all inner points. For prediction, we use a order 4 Neville interpolating filter if all support points... |