TY - GEN
T1 - User-controlled simplification of polygonal models
AU - Hussain, Muhammad
AU - Okada, Yoshihiro
AU - Niijima, Koichi
PY - 2004
Y1 - 2004
N2 - Polygonal Models are ubiquitous in Computer Graphics but their real time manipulation and rendering especially in interactive application environments have become a threat because of their huge sizes and complexity. A whole family of automatic algorithms emerged during the last decade to help out this problem, but they reduce the complexity of the models uniformly without caring about semantic importance of localized parts of a mesh. Only a few algorithms deal with adaptive simplification of polygonal models. We propose a new model for user-driven simplification exploiting the simplification hierarchy and hypertriangulation model [1] that lends a user the most of the functionalities of existing adaptive simplification algorithms in one place and is quite simple to implement. The proposed new underlying data structures are compact and support real time navigation across continuous LODs of a model; any desirable LOD can be extracted efficiently and can further be fine-tuned. The proposed model for adaptive simplification supports two key operations for selective refinement and selective simplification; their effect has been shown on various polygonal models. Comparison with related work shows that the proposed model provides combined environment at reduced overhead of memory space usage and faster running times.
AB - Polygonal Models are ubiquitous in Computer Graphics but their real time manipulation and rendering especially in interactive application environments have become a threat because of their huge sizes and complexity. A whole family of automatic algorithms emerged during the last decade to help out this problem, but they reduce the complexity of the models uniformly without caring about semantic importance of localized parts of a mesh. Only a few algorithms deal with adaptive simplification of polygonal models. We propose a new model for user-driven simplification exploiting the simplification hierarchy and hypertriangulation model [1] that lends a user the most of the functionalities of existing adaptive simplification algorithms in one place and is quite simple to implement. The proposed new underlying data structures are compact and support real time navigation across continuous LODs of a model; any desirable LOD can be extracted efficiently and can further be fine-tuned. The proposed model for adaptive simplification supports two key operations for selective refinement and selective simplification; their effect has been shown on various polygonal models. Comparison with related work shows that the proposed model provides combined environment at reduced overhead of memory space usage and faster running times.
UR - http://www.scopus.com/inward/record.url?scp=16244418111&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=16244418111&partnerID=8YFLogxK
U2 - 10.1109/TDPVT.2004.1335413
DO - 10.1109/TDPVT.2004.1335413
M3 - Conference contribution
AN - SCOPUS:16244418111
SN - 0769522238
SN - 9780769522234
T3 - Proceedings - 2nd International Symposium on 3D Data Processing, Visualization, and Transmission. 3DPVT 2004
SP - 918
EP - 925
BT - Proceedings - 2nd International Symposium on 3D Data Processing, Visualization, and Transmission, 3DPVT 2004
A2 - Aloimonos, Y.
A2 - Taubin, G.
T2 - Proceedings - 2nd International Symposium on 3D Data Processing, Visualization, and Transmission. 3DPVT 2004
Y2 - 6 September 2004 through 9 September 2004
ER -