Abstract We propose a simple yet effective method to perform surface remeshing with hard constraints, such as bounding approximation errors and ensuring Delaunay conditions. The remeshing is formulated as a constrained optimization problem, where the variables contain the mesh connectivity and the mesh geometry. To solve it effectively, we adopt traditional local operations, including edge split, edge collapse, edge flip, and vertex relocation, to update the variables. Central to our method is an evolutionary vertex optimization algorithm, which is derivative‐free and robust. The feasibility and practicability of our method are demonstrated in two applications, including error‐bounded Delaunay mesh simplification and error‐bounded angle improvement with a given number of vertices, over many models. Compared to state‐of‐the‐art methods, our method achieves higher remeshing quality.

Wen‐Xiang Zhang

Qi Wang

Jia‐Peng Guo

Shuangming Chai

Ligang Liu

Xiao‐Ming Fu

Computer Graphics Forum

COMPUTER GRAPHICS FORUM 是 EUROGRAPHICS 的官方期刊，与 WILEY-BLACKWELL 合作出版，是对全球图形开发感兴趣的计算机图形专业人士的独特国际信息来源。它现在是商业和学术环境中计算机图形研究人员、开发人员和用户的主要期刊之一。该杂志报道了世界范围内该领域的最新发展，涵盖了计算机图形学理论、实践和应用的各个方面。

Computer Graphics Forum is the official journal of EUROGRAPHICS, published in collaboration with WILEY-BLACKWELL. It serves as a unique international source of information for computer graphics professionals interested in global graphics development. It is now one of the leading journals for researchers, developers, and users in both commercial and academic settings. The journal reports on the latest developments in the field, covering all aspects of computer graphics theory, practice, and applications.

《Computer Graphics Forum》是EUROGRAPHICS的官方期刊，与WILEY-BLACKWELL合作出版，成为全球计算机图形专业人士获取信息的独特国际来源。它是商业和学术环境中计算机图形研究人员、开发人员和用户的重要期刊之一。该杂志报道了该领域的最新发展，涵盖了计算机图形学的理论、实践和应用的各个方面。

Constrained Remeshing Using Evolutionary Vertex Optimization

A simple yet effective method to perform surface remeshing with hard constraints, such as bounding approximation errors and ensuring Delaunay conditions, and an evolutionary vertex optimization algorithm, which is derivative‐free and robust.

Category	Quartile
计算机科学	4
计算机科学, 计算机软件工程	3

Constrained Remeshing Using Evolutionary Vertex Optimization

ivySCI AI Smartly Parses PDF, Answers Researchers' Questions, and Helps You Understand Papers in Seconds

Journal Info

Category	Quartile
COMPUTER SCIENCE, SOFTWARE ENGINEERING	2