| Multi-resolution out-of-core modeling of terrain and teological data |
| Full text |
Pdf
(285 KB)
|
| Source
|
Geographic Information Systems
archive
Proceedings of the 13th annual ACM international workshop on Geographic information systems
table of contents
Bremen, Germany
SESSION: Data structures, computational geometry
table of contents
Pages: 143 - 152
Year of Publication: 2005
ISBN:1-59593-146-5
|
|
Authors
|
|
Emanuele Danovaro
|
Universit࣑ di Genova-Via Dodecaneso, Genova, Italy & University of Maryland-College Park, MD
|
|
Leila De Floriani
|
Universit࣑ di Genova-Via Dodecaneso, Genova, Italy & University of Maryland-College Park, MD
|
|
Enrico Puppo
|
Universit࣑ di Genova-Via Dodecaneso, Genova, Italy
|
|
Hanan Samet
|
University of Maryland-College Park, MD
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 6, Downloads (12 Months): 68, Citation Count: 1
|
|
|
ABSTRACT
Multi-resolution is a useful tool for managing the complexity of huge terrain and geological data sets. Since encoding large data sets may easily exceed main memory capabilities, data structures and algorithms capable of efficiently working in external memory are needed. In our work, we aim at developing an out-of-core multi-resolution model dimension-independent, that can be used for both terrains, represented by Triangulated Irregular Networks(TINs), and 3D data, such as geological data, represented by tetrahedral meshes. We have based our approach on a general multi-resolution model, that we have proposed in our previous work, which supports the extraction of variable-resolution representations. As first step, we have developed, in a prototype simulation system, a large number of clustering techniques for the modifications in a multi-resolution model. Here, we describe such techniques, and analyze and evaluate them experimentally. The result of this investigation has led us to select a specific clustering approach as the basis for an efficient out-of-core data structure.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
Norbert Beckmann , Hans-Peter Kriegel , Ralf Schneider , Bernhard Seeger, The R*-tree: an efficient and robust access method for points and rectangles, Proceedings of the 1990 ACM SIGMOD international conference on Management of data, p.322-331, May 23-26, 1990, Atlantic City, New Jersey, United States
|
| |
2
|
|
| |
3
|
P. Cignoni, F. Ganovelli, E. Gobbetti, F. Marton, F. Ponchio, and R. Scopigno. Bdam: Batched dynamic adaptive meshes for high performance terrain visualization. Computer Graphics Forum, 22(3):505--514, September 2003.
|
 |
4
|
|
| |
5
|
|
| |
6
|
E. Danovaro. Multi-resolution Modeling of Discrete Scalar Fields. PhD thesis, Dept. of Computer and Information Sciences, University of Genova (Italy), 2005.
|
| |
7
|
Emanuele Danovaro , Leila De Floriani , Paola Magillo , Enrico Puppo , Davide Sobrero , Neta Sokolovsky, The Half-Edge Tree: A Compact Data Structure for Level-of-Detail Tetrahedral Meshes, Proceedings of the International Conference on Shape Modeling and Applications 2005 (SMI' 05), p.334-339, June 13-17, 2005
[doi> 10.1109/SMI.2005.47]
|
| |
8
|
|
| |
9
|
L. De Floriani, E. Puppo, and P. Magillo. A formal approach to multi-resolution modeling. In W. Strasser, R. Klein, and R. Rau, editors, Geometric Modeling: Theory and Practice, pages 302--323. Springer-Verlag, 1997.
|
| |
10
|
|
| |
11
|
J. El-Sana and Y.-J. Chiang. External memory view-dependent simplification. Computer Graphics Forum, 19(3):139--150, August 2000.
|
| |
12
|
|
| |
13
|
|
| |
14
|
|
| |
15
|
|
 |
16
|
|
| |
17
|
|
| |
18
|
|
| |
19
|
|
| |
20
|
P. Magillo. The MT library. http://www.disi.unige.it/person/MagilloP/MT/.
|
| |
21
|
|
| |
22
|
E. M. McCreight. Priority search trees. SIAM Journal on Computing, 14(2):257--276, May 1985.
|
| |
23
|
J. A. Orenstein. Multidimensional tries used for associative searching. Information Processing Letters, 14(4):150--157, 1982.
|
| |
24
|
|
| |
25
|
|
| |
26
|
J. Rossignac and P. Borrel. Multi-resolution 3D approximations for rendering complex scenes. In B. Falcidieno and T. L. Kunii, editors, Modeling in Computer Graphics, pages 455--465. Springer-Verlag, October 17--18 1993.
|
| |
27
|
|
| |
28
|
|
| |
29
|
W. Wang, J. Yang, and R. Muntz. PK-tree: a spatial index structure for high dimensional point data. In K. Tanaka and S. Ghandeharizadeh, editors, Proceedings 5th International Conference on Foundations of Data Organization and Algorithms (FODO), pages 27--36, Kobe, Japan, November 1998.
|
| |
30
|
|
|