Dynamic Cutting Simulation Using Elastic Snapping for Mesh Quality Optimization

Abstract In this manuscript, we present a novel cutting method that involves using a vertex‐snapping strategy to fit the boundary surface onto the cutting path while avoiding generating new elements. We employ a point cloud with polynomial fitting to generate the cutting path, allowing for operation with unscheduled cuts and potential perturbations. Efficient geometry operations are developed to handle topological changes during progressive cutting. While it is challenging to optimize the mesh quality and accurately align the cut surface with the cutting path, we propose an innovative strategy that converts this geometric problem into a quasi‐static elastic problem. This involves solving a constrained elastic problem within an auxiliary simulation, where the system optimizes the mesh quality when reaching equilibrium. Furthermore, we propose modifications to a GPU‐based matrix‐free solver, enabling efficient updates of the precomputed data stored in the GPU memory and thus ensuring real‐time performance.

Authors

Institutions

Publication Details

Journal
Computer Graphics Forum
Published
2025-03-28
DOI
https://doi.org/10.1111/cgf.70005
Primary Topic
Advanced Numerical Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic Cutting Simulation Using Elastic Snapping for Mesh Quality Optimization

Hadrien Courtecuisse, Zhaoyang Zeng
Computer Graphics Forum
Advanced Numerical Analysis Techniques
article

Dynamic Cutting Simulation Using Elastic Snapping for Mesh Quality Optimization

Hadrien Courtecuisse, Zhaoyang Zeng
article en

Abstract

Abstract In this manuscript, we present a novel cutting method that involves using a vertex‐snapping strategy to fit the boundary surface onto the cutting path while avoiding generating new elements. We employ a point cloud with polynomial fitting to generate the cutting path, allowing for operation with unscheduled cuts and potential perturbations. Efficient geometry operations are developed to handle topological changes during progressive cutting. While it is challenging to optimize the mesh quality and accurately align the cut surface with the cutting path, we propose an innovative strategy that converts this geometric problem into a quasi‐static elastic problem. This involves solving a constrained elastic problem within an auxiliary simulation, where the system optimizes the mesh quality when reaching equilibrium. Furthermore, we propose modifications to a GPU‐based matrix‐free solver, enabling efficient updates of the precomputed data stored in the GPU memory and thus ensuring real‐time performance.

Computer Graphics Forum
Centre National de la Recherche Scientifique (FR), Institut national de recherche en sciences et technologies du numérique (FR), Université de Strasbourg (FR)
Agence Nationale de la Recherche
Openalex Percentile: Top 93%
Advanced Numerical Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Dynamic Cutting Simulation Using Elastic Snapping for Mesh Quality Optimization — Hadrien Courtecuisse, Zhaoyang Zeng · Computer Graphics Forum (2025) | TGRS Research Map | TGRS