Loading…
A fast and memory-efficient method for LOD modeling of polygonal models
Ever growing complexity of polygonal models hinders the rendering and manipulation of such models on available graphics hardware resources. LOD (level of detail) management only can make such models suitable for various applications. We propose an automatic method for generating LODs of a given poly...
Saved in:
Main Authors: | , , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Citations: | Items that cite this one |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Ever growing complexity of polygonal models hinders the rendering and manipulation of such models on available graphics hardware resources. LOD (level of detail) management only can make such models suitable for various applications. We propose an automatic method for generating LODs of a given polygonal model that is based on edge collapse operation. In an edge collapse algorithm, the way how to measure the error introduced as a result of an edge collapse transformation plays a crucial role in determining the ordering of such transformations. We introduce a measure of geometric deviation, which is based on local evaluation and accumulation of error, and is simple to implement, involves short running times, is memory efficient and preserves geometric features and discontinuities automatically. Results and numerical comparisons show that our algorithm generates simplified models at different LODs of good visual fidelity, which are comparable with those by other methods. |
---|---|
DOI: | 10.1109/GMAG.2003.1219678 |