Approximating Surfaces in R^3 by Meshes with Guaranteed Regularity

01/24/2020
by   Joel Hass, et al.
0

We study the problem of approximating a surface F in R^3 by a high quality mesh, a piecewise-flat triangulated surface whose triangles are as close as possible to equilateral. The MidNormal algorithm generates a triangular mesh that is guaranteed to have angles in the interval [49.1^o, 81.8^o]. As the mesh size e→ 0, the mesh converges pointwise to F through surfaces that are isotopic to F. The GradNormal algorithm gives a piecewise-C^1 approximation of F, with angles in the interval [35.2^o, 101.5^o] as e→ 0. Previously achieved angle bounds were in the interval [30^o, 120^o].

READ FULL TEXT
research
07/20/2020

Quadrilateral meshes for PSLGs

We prove that every planar straight line graph with n vertices has a con...
research
06/03/2016

Conforming restricted Delaunay mesh generation for piecewise smooth complexes

A Frontal-Delaunay refinement algorithm for mesh generation in piecewise...
research
04/13/2022

Creating good quality meshes from smooth implicit surfaces

Visualization of implicit surfaces is an actively researched topic. Whil...
research
11/07/2016

Error-Bounded and Feature Preserving Surface Remeshing with Minimal Angle Improvement

The typical goal of surface remeshing consists in finding a mesh that is...
research
04/20/2020

Robust and efficient tool path generation for poor-quality triangular mesh surface machining

This paper presents a new method to generate iso-scallop tool paths for ...
research
03/22/2022

Piecewise discretization of monodromy operators of delay equations on adapted meshes

Periodic solutions of delay equations are usually approximated as contin...
research
05/03/2021

A 3D Advancing-Front Delaunay Mesh Refinement Algorithm

I present a 3D advancing-front mesh refinement algorithm that generates ...

Please sign up or login with your details

Forgot password? Click here to reset