A fast and memory-efficient method for LOD modelling of polygonal models

被引:6
|
作者
Hussain, M [1 ]
Okada, Y [1 ]
Niijima, K [1 ]
机构
[1] Kyushu Univ, Grad Sch Informat Sci & Elect Engn, Kasuga, Fukuoka 8168580, Japan
关键词
triangular meshes; surface simplification; level of detail; edge-collapse; multiresolution modeling;
D O I
10.1109/GMAG.2003.1219678
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Ever growing complexity of polygonal models hinders the rendering and manipulation of such models on available graphics hardware resources. LOD management only can make such models suitable for various applications. We propose a new 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 new 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.
引用
收藏
页码:137 / 142
页数:6
相关论文
共 50 条
  • [21] Fast, Memory-Efficient Spectral Clustering with Cosine Similarity
    Li, Ran
    Chen, Guangliang
    PROGRESS IN PATTERN RECOGNITION, IMAGE ANALYSIS, COMPUTER VISION, AND APPLICATIONS, CIARP 2023, PT I, 2024, 14469 : 700 - 714
  • [22] A FAST AND MEMORY-EFFICIENT ALGORITHM FOR ROBUST PCA (MEROP)
    Narayanamurthy, Praneeth
    Vaswani, Namrata
    2018 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2018, : 4684 - 4688
  • [23] Fast, Accurate and Memory-Efficient Partial Permutation Synchronization
    Li, Shaohan
    Shi, Yunpeng
    Lerman, Gilad
    2022 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2022), 2022, : 15714 - 15722
  • [24] Fast and Memory-Efficient Import Vector Domain Description
    Decherchi, Sergio
    Cavalli, Andrea
    NEURAL PROCESSING LETTERS, 2020, 52 (01) : 511 - 524
  • [25] A Fast and Memory-Efficient Approach to NDN Name Lookup
    He, Dacheng
    Zhang, Dafang
    Xu, Ke
    Huang, Kun
    Li, Yanbiao
    CHINA COMMUNICATIONS, 2017, 14 (10) : 61 - 69
  • [26] A Fast and Memory-Efficient Approach to NDN Name Lookup
    Dacheng He
    Dafang Zhang
    Ke Xu
    Kun Huang
    Yanbiao Li
    中国通信, 2017, 14 (10) : 61 - 69
  • [27] Fast and Memory-Efficient Import Vector Domain Description
    Sergio Decherchi
    Andrea Cavalli
    Neural Processing Letters, 2020, 52 : 511 - 524
  • [28] A fast and memory-efficient hierarchical graph clustering algorithm
    Szilágyi, László
    Szilágyi, Sándor Miklós
    Hirsbrunner, Béat
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8834 : 247 - 254
  • [29] Fast, memory-efficient traffic estimation by coincidence counting
    Hao, F
    Kodialam, M
    Lakshman, TV
    Zhang, H
    IEEE INFOCOM 2005: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-4, PROCEEDINGS, 2005, : 2080 - 2090
  • [30] A memory-efficient scheme for fast spectral photon mapping
    Ikeda, Kosuke
    Takizawa, Hiroyuki
    Kobayashi, Hiroaki
    PROCEEDINGS OF THE NINTH IASTED INTERNATIONAL CONFERENCE ON COMPUTER GRAPHICS AND IMAGING, 2007, : 75 - 80