Papers › Approximating Surfaces in R³ by Meshes with Guaranteed Regularity
Approximating Surfaces in R³ by Meshes with Guaranteed Regularity
Joel Hass, Maria Trnkova
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We study the problem of approximating a surface F in R³ 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ᵒ, 81.8ᵒ]. 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¹ approximation of F, with angles in the interval [35.2ᵒ, 101.5ᵒ] as e→0. Previously achieved angle bounds were in the interval [30ᵒ, 120ᵒ].
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections