Triangle meshes are used in many important shape-related applications including geometric modeling, animation production, system simulation, and visualization. However, these meshes are typically generated in raw form with several defects and poor-quality elements, obstructing them from practical application. Over the past decades, different surface remeshing techniques have been presented to improve these poor-quality meshes prior to the downstream utilization. A typical surface remeshing algorithm converts an input mesh into a higher quality mesh with consideration of given quality requirements as well as an acceptable approximation to the input mesh. In recent years, surface remeshing has gained significant attention from researchers and engineers, and several remeshing algorithms have been proposed. However, there has been no survey article on remeshing methods in general with a defined search strategy and article selection mechanism covering the recent approaches in surface remeshing domain with a good connection to classical approaches. In this article, we present a survey on surface remeshing techniques, classifying all collected articles in different categories and analyzing specific methods with their advantages, disadvantages, and possible future improvements. Following the systematic literature review methodology, we define step-by-step guidelines throughout the review process, including search strategy, literature inclusion/exclusion criteria, article quality assessment, and data extraction. With the aim of literature collection and classification based on data extraction, we summarized collected articles, considering the key remeshing objectives, the way the mesh quality is defined and improved, and the way their techniques are compared with other previous methods. Remeshing objectives are described by angle range control, feature preservation, error control, valence optimization, and remeshing compatibility. The metrics used in the literature for the evaluation of surface remeshing algorithms are discussed. Meshing techniques are compared with other related methods via a comprehensive table with indices of the method name, the remeshing challenge met and solved, the category the method belongs to, and the year of publication. We expect this survey to be a practical reference for surface remeshing in terms of literature classification, method analysis, and future prospects. 

Surface Remeshing: A Systematic Literature Review of Methods and Research Directions

Image-driven simplification

New approaches for Delaunay triangulation and optimisation

W. Hörmann, J. Leydold, G. Derflinger: Automatic nonuniform random variate generation

Research on viewpoint in 3D scenes has been a cutting-edge subject in computer vision and 3D scene understanding. Calculating a high quality 3D viewpoint in virtual scenes is conducive to a more comprehensive analysis of 3D graphic structure, which can contribute to an overall understanding of virtual environments. 3D viewpoint research can also be applied to the analysis of structural relationships in virtual scenes and to exploit hidden hierarchical structures, thus it plays a role in fields such as scientific visualization computing or image-based scene modeling. Viewpoint research combined with relevant research results of human visual perception or visual psychology can be used to analyze the visual interest and focus areas of 3D objects in human vision, thus effectively improving the quality of mesh simplification and rendering efficiency, as well as providing an optimization basis for highly complex scenes. In fields such as 3D computer games, virtual reality, and landscape animation, research on high-quality viewpoints can be adopted to optimize global lighting and illumination. Additionally, practical applications can be realized through user attention analysis and aesthetic improvement strategies based on high-quality viewpoints, such as intelligent modeling and scene optimization calculations. In common fields such as 3D model retrieval, practical applications can be realized for saliency research, scientific visualization computing, and medical 3D imaging. In-depth research has been performed and extensive applications have been developed that make use of viewpoint analysis. In this paper, we introduce an optimization strategy to calculate high-quality virtual viewpoints for aesthetic images. A novel framework is proposed for modifying and optimizing the viewpoint calculation model by combining a multibranch CNN and a viewpoint correction method, thus realizing rendered images with a higher aesthetic quality. By attempting to fully integrate the visual perception with the geometric information calculation, we expect this method to achieve more comprehensive applications in many practice areas in the future, such as the realization of aesthetically based virtual camera path planning and analysis of the aesthetic characteristics of virtual environments.

/pdf/3d-viewpoint-estimation-based-on-aesthetics-xozdu8kn6o.pdf

3D Viewpoint Estimation Based on Aesthetics

Complex mesh models usually affect the performance of algorithms for CAD applications. Therefore, it is often desirable to use simplified models and at the same time preserves the general features of the shape. In this paper, we present an entropy based surface mesh simplification algorithm which can rapidly and efficiently produce high quality approximations of triangle mesh models. The algorithm uses iterative contraction of edges to simplify models. It first exploits the geometric feature of model surface by estimating vertex curvature entropy and then iteratively contracts edges with relatively lower simplification cost. The simplification cost is measured by a combination of vertex curvature and curvature entropy of the two vertices compositing the edge. The goal is to simplify regions that are relatively flat while preserving salient features of the shape. Experiments show promising results of the algorithm.

/pdf/entropy-based-mesh-simplification-4ayhxq3dv5.pdf

Entropy-based Mesh Simplification

In this paper, a novel visual and geometry-based simplification approach is proposed for simplifying polygonal meshes. This approach is driven by a visual importance weighted quadric error metric, which measures not only the geometry differentiation but also the local surface variation. We define the visual importance of one vertex based on its vertex curvature entropy which reflects the visually variation of the region centered at this vertex. We observe that such a definition of visual importance is capable of capturing visually interesting regions on a mesh. By combining the visual importance and quadric error metric to measure the edge collapse error, this algorithm produces simplified model closer to the original one according to visual similarity. One main application of this algorithm is the simplification of models for video games where the models are usually geometrically not very complex, and in which visual similarity is the most important requirement.

A Visual and Geometry-based Hybrid Approach for Surface Simplification

We present an approach to accelerate spherical range-search (SRS) for dynamic points that employs the computational power of many-core GPUs. Unlike finding kapproximate nearest neighbours (ANNs), exact SRS is needed in geometry processing and physical simulation to avoid missing small features. The spatial coherence of query points and the temporal coherence of dynamic points are exploited in our approach to achieve very efficient range-search on AABB-trees. We test our coherent SRS in several applications including point-point-set geometry processing, distance-field generation and particle-based simulation, which are best scenarios to present the spatial and the temporal coherence of spherical queries on dynamic points. On a PC with NVIDIA GTX 660 Ti GPUs, our approach can take 1M queries on 1M dynamic points at a rate of 1600 queries/ms, where 49 neighbours are found on average within the range of 1/100 of the bounding-boxs diagonal length. We observe an increase of up to 4x compared with conventional voxel-based GPU searching approaches in the benchmark of particle-based fluid simulation. Moreover, the speedup can be scaled up to 150x when being applied to highly non-uniform distribution of particles in the simulation. We present an approach to accelerate spherical range-search (SRS) for dynamic points that employs the computational power of many-core GPUs.The spatial coherence of query points and the temporal coherence of dynamic points are exploited in our approach to achieve very efficient range-search on AABB-trees.We test our coherent SRS in several applications including point-set geometry processing, distance-field generation and particle-based simulation.We observe an increase in speed of up to 4 times compared with state-of-the- art approaches running on GPUs.

Coherent spherical range-search for dynamic points on GPUs

A proposed framework for remeshing polygonal models employs mesh-free techniques for processing surface sample points. It's robust to input models with problematic connectivity, and the geometric processing of points runs easily in parallel on a GPU. The framework extracts visual-perception information in the image space and maps it back to the Euclidean space. On the basis of these visual cues, the framework generates a saliency field to resample the input model. A new projection operator further optimizes the distribution of resampled points. Because the downsampled points control the number of vertices on the resulting model, this framework also works for model simplification. All the algorithms in the framework can be easily parallelized to run on GPUs. In experiments, the framework remeshed diverse polygonal models to well-shaped triangular meshes with high visual fidelity.

Highly Parallel Algorithms for Visual-Perception-Guided Surface Remeshing

Popular Tasks used by Researchers

How can I help with your research?

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

We encountered an error while loading the panel. Please try refreshing the page.

Something went wrong

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

Anyone with the link can view this chat. You can switch it back to private anytime.

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Lian Ping Xing

Author Tools

Chat about Author

Papers

Entropy-based Mesh Simplification

A Visual and Geometry-based Hybrid Approach for Surface Simplification

Coherent spherical range-search for dynamic points on GPUs

Highly Parallel Algorithms for Visual-Perception-Guided Surface Remeshing