Simplification of Fan-Meshes models for fast rendering of large 3D point-sampled scenes

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Fan-Meshes (FM) are a kind of geometrical primitives for generating 3D model or scene descriptions that are able to preserve both local geometrical details and topological structures. In this paper, we propose an efficient simplification algorithm for the FM models to achieve fast post-processing and rendering of large models or scenes. Given a global error tolerance for the surface approximation, the algorithm can find an approximately minimal set of FMs that covers the whole model surfaces. As compared with splat-based methods, the FM description has a large simplification rate under the same surface fitting error measurement. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Yan, X., Meng, F., & Zha, H. (2005). Simplification of Fan-Meshes models for fast rendering of large 3D point-sampled scenes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3617 LNCS, pp. 99–106). https://doi.org/10.1007/11553595_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free