Fast Mesh Simplification Method for Three-Dimensional Geometric Models with Feature-Preserving Efficiency

Wang, Yongzhi; Zheng, Jianwen; Wang, Hui

doi:10.1155/2019/4926190

Cited by 17 publications

(14 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Various mesh simplification techniques have been proposed [ 5 , 7 , 16 – 20 ], and the HPC architectures of recent GPUs have inspired parallel techniques [ 9 , 12 , 13 ] that can be applied to effectively simplify meshes. In the following two subsections, we summarize the key research on serial and parallel methods.…”

Section: Related Workmentioning

confidence: 99%

High-performance simplification of triangular surfaces using a GPU

Mousa

Hussein

2021

PLoS ONE

View full text Add to dashboard Cite

Due to advances in high-performance computing technologies, computer graphics techniques—especially those related to mesh simplification—have been noticeably improved. These techniques, which have a strong impact on many applications, such as geometric modeling and visualization, have been well studied for more than two decades. Recent advances in GPUs have led to significant improvements in terms of speed and interactivity. In this paper, we present a mesh simplification algorithm that benefits from the parallel framework provided by recent GPUs. We customize the halfedge data structure for adaption with the dynamic memory restrictions of CUDA. The proposed algorithm is fully parallelized by employing a lock-free skip priority queue and a set of disjoint regions of the mesh. The proposed technique accelerates the simplification process while preserving the topological properties of the mesh. Some results and comparisons are provided to verify the efficiency of the proposed algorithm.

show abstract

Section: Related Workmentioning

confidence: 99%

High-performance simplification of triangular surfaces using a GPU

Mousa

Hussein

2021

PLoS ONE

View full text Add to dashboard Cite

show abstract

“…In the first stage, the point model is divided into multiple slices similar to the plane according to the principle of geometric approximation; in the second stage, the hierarchical spatial clustering simplification is performed on the basis of the slices. Wang and colleagues proposed a point model simplification method based on geometric images and a point model simplification algorithm based on similarity (23). The point model simplification algorithm based on geometric image maps the spherical polar coordinates of the point model to the plane to construct its geometric image.…”

Section: Simplification Of Curved Surfacesmentioning

confidence: 99%

A Development Perspective of Point-Based Computer Graphics

Mukti

2021

Sci Insigt

View full text Add to dashboard Cite

Every object has its characteristic shape, appearance and responses to physical interactions. Computer graphics center on those three components of an object to bring them onto the computer display. With the rapid development of three dimensional (3D) printing technology, the accuracy of the focused object’s geometry was put forward. Point-based graphing is a way to taking the role in rendering the huge 3D sampled data. Based on the digital geometry processing of point-sampled model, various algorithms were reviewed, and some related key techniques were compared with the potential perspective of the future work in this area was also presented．

show abstract

“…The algorithm calculates the cost of simplification based on the local curvature and internal angle of the triangle and prioritizes the deletions of the nearest equilateral triangle and the flattest triangle around it. Wang et al proposed a triangle collapse algorithm that preserves model characteristics by using an energy operator [26]. Zhang et al proposed a triangle folding algorithm combining finite element analysis with curvature [27].…”

Section: A Triangle Mesh Simplification Algorithmmentioning

confidence: 99%

Mesh Simplification Algorithm Based on the Quadratic Error Metric and Triangle Collapse

2020

View full text Add to dashboard Cite

Triangular mesh is a commonly used method for representing 3D models. With the continuous development of 3D modeling and scanning technologies, the complexity of the mesh is increasing. The greater the density of the mesh is, the higher the representation quality of the model. However, a higher mesh density also results in greater storage and time costs. Mesh simplification is a basic research topic in the fields of computer graphics and virtual reality. This paper implements a mesh simplification algorithm based on triangle collapse. The algorithm uses a half-edge data structure to record the mesh information, obtains the folding point by minimizing the sum of squares of the spatial distances from the folding point to all adjacent surfaces, and then calculates the folding cost and folding order. The algorithm iteratively folds the triangular faces with the smallest folding costs to achieve mesh simplification. By processing a large number of models, it is proven that the algorithm in this paper can retain the original model features during the simplification process.

show abstract

Fast Mesh Simplification Method for Three-Dimensional Geometric Models with Feature-Preserving Efficiency

Cited by 17 publications

References 32 publications

High-performance simplification of triangular surfaces using a GPU

High-performance simplification of triangular surfaces using a GPU

A Development Perspective of Point-Based Computer Graphics

Mesh Simplification Algorithm Based on the Quadratic Error Metric and Triangle Collapse

Contact Info

Product

Resources

About