scholarly journals Feature-preserving 3D mesh simplification for urban buildings

2021 ◽  
Vol 173 ◽  
pp. 135-150
Author(s):  
Minglei Li ◽  
Liangliang Nan
2009 ◽  
Vol 32 (2) ◽  
pp. 203-212 ◽  
Author(s):  
Yuan-Feng ZHOU ◽  
Cai-Ming ZHANG ◽  
Ping HE

2012 ◽  
Vol 263-266 ◽  
pp. 2320-2323 ◽  
Author(s):  
Ying Gao ◽  
Rui Zhao Wang ◽  
Jue Yuan

Based on interest point detection, a feature preserving mesh simplification algorithm is proposed. The Harris operator values of all vertices in the mesh were computed firstly. On the base of Garland’s simplification algorithm, we combine the Harris operator value with quadric error metric and change the order of edge collapsing in the simplification. The experimental results show that the proposed algorithm is effective and feature preserving.


2019 ◽  
Vol 27 (4) ◽  
pp. 971-983
Author(s):  
曹增欢 CAO Zeng-huan ◽  
黄常标 HUANG Chang-biao ◽  
郑 红 ZHENG hong

2020 ◽  
Vol 27 (4) ◽  
pp. 417-435 ◽  
Author(s):  
Yaqian Liang ◽  
Fazhi He ◽  
Xiantao Zeng

Large-scale 3D models consume large computing and storage resources. To address this challenging problem, this paper proposes a new method to obtain the optimal simplified 3D mesh models with the minimum approximation error. First, we propose a feature-preservation edge collapse operation to maintain the feature edges, in which the collapsing cost is calculated in a novel way by combining Gauss curvature and Quadratic Error Metrics (QEM). Second, we introduce the edge splitting operation into the mesh simplification process and propose a hybrid ‘undo/redo’ mechanism that combines the edge splitting and edge collapse operation to reduce the number of long and narrow triangles. Third, the proposed ‘undo/redo’ mechanism can also reduce the approximation error; however, it is impossible to manually choose the best operation sequence combination that can result in the minimum approximation error. To solve this problem, we formulate the proposed mesh simplification process as an optimization model, in which the solution space is composed of the possible combinations of operation sequences, and the optimization objective is the minimum of the approximation error. Finally, we propose a novel optimization algorithm, WOA-DE, by replacing the exploration phase of the original Whale Optimization Algorithm (WOA) with the mutate and crossover operations of Differential Evolution (DE) to compute the optimal simplified mesh model more efficiently. We conduct numerous experiments to test the capabilities of the proposed method, and the experimental results show that our method outperforms the previous methods in terms of the geometric feature preservation, triangle quality, and approximation error.


Author(s):  
Wei Lyu ◽  
Wei Wu ◽  
Lin Zhang ◽  
Zhaohui Wu ◽  
Zhong Zhou

We propose a novel Laplacian-based algorithm that simplifies triangle surface meshes and can provide different preservation ratios of geometric features. Our efficient and fast algorithm uses a 3D mesh model as input and initially detects geometric features by using a Laplacian-based shape descriptor (L-descriptor). The algorithm further performs an optimized clustering approach that combines a Laplacian operator with K-means clustering algorithm to perform vertex classification. Moreover, we introduce a Laplacian weighted cost function based on L-descriptor to perform feature weighting and error statistics comparison, which are further used to change the deletion order of the model elements and preserve the saliency features. Our algorithm can provide different preservation ratios of geometric features and may be extended to handle arbitrary mesh topologies. Our experiments on a variety of 3D surface meshes demonstrate the advantages of our algorithm in terms of improving accuracy and applicability, and preserving saliency geometric features.


2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Yongzhi Wang ◽  
Jianwen Zheng ◽  
Hui Wang

To avoid excessive details, thus omitting less important content, of three-dimensional (3D) geometric models, this study proposes a fast mesh simplification method based on an energy-operator for 3D geometric models with salient feature-preserving efficiency. The energy-operator can evaluate the smoothness and complexity of the regional mesh in 3D models. Accordingly, it can be directly used to simultaneously reduce the candidate triangle and its three neighboring triangles. The proposed method can dramatically collapse the excessive details in relatively smooth areas and preserve more important salient features during the simplification process. It can also maintain a trade-off between time efficiency and salient feature-preserving accuracy. The effectiveness and efficiency of the new method are demonstrated by comparing it with OpenMesh, which is considered the most popular mesh operation software and is capable of achieving accurate mesh simplification models. The new mesh simplification method based on the energy-operator can provide accurate and concise models for interactive 3D rendering, calculating, simulating, and analyzing.


Sign in / Sign up

Export Citation Format

Share Document