A 3D simplification algorithm for distributed visualization
One of the challenging problems that hinder the development of distributed design systems is the contradiction of large CAD files and the limited speed to share them over the Internet and Web. 3D streaming technique, which can allow effective and efficient dispatch and access of large-volume CAD dat...
Gespeichert in:
Veröffentlicht in: | Computers in industry 2007-04, Vol.58 (3), p.211-226 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | One of the challenging problems that hinder the development of distributed design systems is the contradiction of large CAD files and the limited speed to share them over the Internet and Web. 3D streaming technique, which can allow effective and efficient dispatch and access of large-volume CAD data as a series of patched streams across the Internet, provides a promising solution to overcome the obstacle. Geometric simplification (or decimation) of 3D models is a key algorithm to realize the streaming technique. In this paper, a new geometric simplification algorithm has been developed, in which two criteria are the crucial elements to control the collapse process for edges in 3D VRML models to reduce the amount of information. After the simplification and sharing of a model, a developed refinement algorithm is carried out to restore the model from its simplified version back to its original, through combining the simplified model with some reconstruction data generated during the simplification process, therefore, to realize the streaming information sharing. The major feature of the simplification algorithm is that it has incorporated some advantages of the previously developed vertex decimation approach and edge collapse approach. Meanwhile, the mechanism of adaptive threshold parameters adopted in this work enhances the adaptability of the algorithm for various applications. Through case studies and comparisons with some related works, the algorithm shows good performance and potentials in terms of effectiveness, adaptability and robustness. |
---|---|
ISSN: | 0166-3615 1872-6194 |
DOI: | 10.1016/j.compind.2006.05.003 |