A Hierarchical Model for Multiresolution Surface Reconstruction

Voigtmann, Andreas; Becker, Ludger; Hinrichs, Klaus

doi:10.1006/gmip.1997.0436

Cited by 11 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Algorithms on hierarchical ARTICLES triangle models were addressed by Heller [16] , Soucy and Laurendeau [17] , De Floriani et al [2] , and Voigtmann et al [18] . The principle of this category of algorithm is to iteratively insert a vertex into the regions of a TIN model with a lower level of accuracy based on the Delaunnay triangle algorithm.…”

Section: Previous Workmentioning

confidence: 99%

A robust and rapid algorithm for generating and transmitting multi-resolution three-dimensional models

Wang

Gong

2006

CHINESE SCI BULL

View full text Add to dashboard Cite

Recent advances in 3D spatial data capture, such as high resolution satellite images and laser scanning as well as corresponding data processing and modeling technologies, have led to the generation of large amounts of datasets on terrains, buildings, roads and other features. The rapid transmission and visualization of 3D models has become a 'bottleneck' of internet-based applications. This paper proposes a robust algorithm to generate multi-resolution models for rapid visualization and network transmission of 3D models. Experiments were undertaken to evaluate the performance of the proposed algorithm. Experimental results demonstrate that the proposed algorithm achieves good performance in terms of running speed, accuracy, encoding of multi-resolution models, and network transmission.Recent advances in 3D spatial data capture, such as high resolution satellite images and laser scanning, as well as corresponding data processing and modeling technologies have led to the generation of large amounts of datasets on terrains, buildings, roads and other features. On the one hand, the internet has become a popular platform for data sharing, data transmission, distributing computation, and visualization. However, the volume of data is far beyond the processing capabilities of current workstation and rapid network transmission (e.g. rapid 3D visualization, and rapid transmission). On the other hand, users have to wait a long time for data downloading from server side to client side after querying operation is invoked, and they can not implement any operations on the spatial data until the downloading is finished. It is also impossible for them to first access the data with a lower resolution data version, then to get a higher resolution data version until the whole data are downloaded. Investigation shows that most users have difficulty to accept such long waits. To solve this problem, one promising solution is to deliver the spatial datasets at increasing levels of detail (LoD) from the server to the client (a process called progressive transmission). The most important advantage of progressive transmission methods is that they are capable of giving users a rapid preliminary view of spatial data. Moreover, users can navigate through the data during the transmission procedure, e.g. through zooming, panning, spatial queries, and so on. Triangle-based 3D model begins to receive more attention because it has simple data structure and is easy to be rendered by common graphics cards. This paper proposes a rapid and robust algorithm to construct multi-resolution 3D models and to progressively transmit triangle based 3D data models over the internet. The algorithm has better performance in terms of the efficiency of generating multi-resolution 3D models, encoding and storage of 3D models, validity check of topological relationship, and features preservation and accuracy evaluation of multi-resolution 3D models. Previous workMulti-resolution models have been a focus of research in many areas such as the visualization of terrain ...

show abstract

Section: Previous Workmentioning

confidence: 99%

A robust and rapid algorithm for generating and transmitting multi-resolution three-dimensional models

Wang

Gong

2006

CHINESE SCI BULL

View full text Add to dashboard Cite

show abstract

“…Hierarchical triangulations based on TINs have been applied to generate multiresolution models which can be used by level of detail algorithms (de Berg and Dobrint [2], de Floriani and Puppo [3], Gross et al [8], and Voigtmann et al [16]). Regular grids have been used for multiresolution modeling (Falby et al [6]) and for real-time, continuous LOD rendering (Lindstrom et al [10], and Pajarola [12]).…”

Section: Related Workmentioning

confidence: 99%

“…Various hierarchical data structures have been developed for representing terrains, e.g., hierarchical TINs (de Floriani and Puppo [3]), R-trees for terrain data (Kofler et al [9]), restricted quadtree triangulations (Pajarola [12]), and constrained Delaunay pyramids (Voigtmann et al [16]). Each data structure supports a specific type of input data such as arbitrarily distributed data points for triangulated irregular networks (TINs) or regularly distributed data points for grids.…”

Section: Introductionmentioning

confidence: 99%

A hybrid, hierarchical data structure for real-time terrain visualization

Baumann

Dollner

Hinrichs

et al. 1999

Proceedings Computer Graphics International CGI-99

View full text Add to dashboard Cite

The approximation tree is a hybrid, hierarchical data structure for real-time terrain visualization which represents both geometry data and texture data of a terrain in a hierarchical manner. This framework can integrate different multiresolution modeling techniques operating on different types of data sets such as TINs, regular grids, and non-regular grids. An approximation tree recursively aggregates terrain patches which reference geometry data and texture data. The rendering algorithm selects patches based on a geometric approximation error and a texture approximation error. Terrain shading and thematic texturing, which can be generated in a preprocessing step, improve the visual quality of level of detail models and eliminate the defects resulting from a Gouraud shaded geometric model since they do not depend on the current (probably reduced) geometry. The approximation tree can be implemented efficiently using object-oriented design principles. A case study for cartographic landscape visualization illustrates the use of approximation trees.

show abstract

“…De Floriani et al (2000) developed a system based on the hierarchical triangle model, which was proposed by De Floriani (1989) to construct multi-resolution TINs. Algorithms on hierarchy triangle models were addressed by Heller (1990), Soucy and Laurendeau (1992, 1996), De Floriani et al (1996, Voigtmann et al (1997) and Pedrini (2000). The principle of this category of algorithm is to iteratively insert a vertex into the regions of a TIN model with a lower level of accuracy based on the Delaunnay triangle algorithm.…”

Section: A Review Of Related Studiesmentioning

confidence: 99%

A Dynamic Method for Generating Multi-Resolution TIN Models

Wang¹,

Shi²,

Li³

2005

photogramm eng remote sensing

View full text Add to dashboard Cite

It is essential to generate multi-resolution Triangulated Irregular Network (TIN) models dynamically and efficiently in three-dimensional (3D) visualization, virtual reality, and geographic information systems (GIS), because the data that needs to be processed is multiple in scale and large in volume. This paper proposes a new method, which extends the edge collapse and vertex split algorithms, to dynamically generate a multi-resolution TIN models. In contrast to previous approaches, a new method is proposed to encode and store vertex dependency relationships in the multi-resolution model. As a result, the validity of vertex splits and edge collapses is improved; the efficiency of storing data is also enhanced by the proposed method. To evaluate the performance of the proposed method, we further extend the assessment to (a) time cost; (b) the quality of the multi-resolution TIN model; and (c) the view-dependent multi-resolution model. The root mean square error (RMSE) of the elevation of the vertex and the quality of the shape of the triangle are adopted to evaluate the quality of a generated multiresolution TIN model. The results of the experiment demonstrate that the proposed method performs better than previous methods in terms of time cost, and can achieve multiresolution TIN models with a higher accuracy.

show abstract

A Hierarchical Model for Multiresolution Surface Reconstruction

Cited by 11 publications

References 10 publications

A robust and rapid algorithm for generating and transmitting multi-resolution three-dimensional models

A robust and rapid algorithm for generating and transmitting multi-resolution three-dimensional models

A hybrid, hierarchical data structure for real-time terrain visualization

A Dynamic Method for Generating Multi-Resolution TIN Models

Contact Info

Product

Resources

About