A new Voronoi-based surface reconstruction algorithm
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
A simple algorithm for homeomorphic surface reconstruction
Proceedings of the sixteenth annual symposium on Computational geometry
Smooth surface reconstruction via natural neighbour interpolation of distance functions
Proceedings of the sixteenth annual symposium on Computational geometry
Geometric accuracy analysis for discrete surface approximation
Computer Aided Geometric Design
Geometric accuracy analysis for discrete surface approximation
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
| Hi-index | 0.00 |
We approximate the normals and the area of a smooth surface with the normals and the area of a triangulated mesh whose vertices belong to the smooth surface. Both approximations only depend on the triangulated mesh (which is supposed to be known), on an upper bound on the smooth surface's curvature, on an upper bound on its reach (which is linked to the local feature size) and on an upper bound on the Hausdorff distance between both surfaces.We show in particular that the upper bound on the error of the normals is better when triangles are right-angled (even if there are small angles). We do not need every angle to be quite large. We just need each triangle of the triangulated mesh to contain at least one angle whose sinus is large enough.