
Proceedings Paper
Fast and memory-efficient generation of simplified meshesFormat | Member Price | Non-Member Price |
---|---|---|
$17.00 | $21.00 |
Paper Abstract
Triangle meshes are used to represent surfaces in many applications due to their simplicity. Since the number of triangles often goes beyond the capabilities of computer graphics hardware, a large variety of simplified mesh construction algorithms have been proposed in the last years. But, the reconstruction processes of simplified meshes are generally time-consuming and memory inefficient. In this paper we suggest a fast and memory efficient method that produces high-quality simplified-polygonal-models. The method is based both on Marching Cubes algorithm and on Decimation method.
Paper Details
Date Published: 18 April 2000
PDF: 6 pages
Proc. SPIE 3976, Medical Imaging 2000: Image Display and Visualization, (18 April 2000); doi: 10.1117/12.383073
Published in SPIE Proceedings Vol. 3976:
Medical Imaging 2000: Image Display and Visualization
Seong Ki Mun, Editor(s)
PDF: 6 pages
Proc. SPIE 3976, Medical Imaging 2000: Image Display and Visualization, (18 April 2000); doi: 10.1117/12.383073
Show Author Affiliations
Junki Lee, Hanyang Univ. (South Korea)
June-Sic Kim, Hanyang Univ. (South Korea)
June-Sic Kim, Hanyang Univ. (South Korea)
Dae-Won Kim, Hanyang Univ. (South Korea)
Sun Il Kim, Hanyang Univ. (South Korea)
Sun Il Kim, Hanyang Univ. (South Korea)
Published in SPIE Proceedings Vol. 3976:
Medical Imaging 2000: Image Display and Visualization
Seong Ki Mun, Editor(s)
© SPIE. Terms of Use
