Name
Abstract | ||
|---|---|---|
Digital terrains are generally large les and need tobe simplied to be rendered eciently. We proposeto build an adaptive embedded triangulation based ona binary tree structure to generate multiple levels ofdetails. We present a O(n log n) decimation algorithmand a O(n log n) renement algorithm, where n isthe number of elevation points. We compare themin a rate-distortion (RD) framework. The algorithmsare based on an improved version of the optimal treepruning algorithm G-BFOS... |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1109/ICIP.1998.723704 | ICIP |
Keywords | Field | DocType |
computational complexity,optimisation,rate distortion theory,rendering (computer graphics),tree data structures,G-BFOS,adaptive embedded triangulation,binary tree structure,constrained tree structures,decimation algorithm,digital terrains,efficient algorithms,elevation points,embedded rendering,large files,nonmonotonic tree functionals,optimal tree pruning algorithm,rate-distortion framework,refinement algorithm,terrain models | Tree traversal,Computer science,k-d tree,Self-balancing binary search tree,Optimal binary search tree,Binary tree,Algorithm,Tree structure,Fractal tree index,Interval tree | Conference |
Volume | Citations | PageRank |
2 | 11 | 0.97 |
References | Authors | |
2 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Laurent Balmelli | 1 | 74 | 7.56 |
| Serge Ayer | 2 | 287 | 83.10 |
| Martin Vetterli | 3 | 13926 | 2397.68 |