[PDF][PDF] Smooth surface reconstruction via natural neighbour interpolation of distance functions
JD Boissonnat, F Cazals - … of the sixteenth annual symposium on …, 2000 - dl.acm.org
JD Boissonnat, F Cazals
Proceedings of the sixteenth annual symposium on Computational geometry, 2000•dl.acm.orgWe present an algorithm to reconstruct smooth surfaces of arbitrary topology from
unorganised sample points and normals. The method uses natural neighbour interpolation,
works in any dimension and allows to deal with non uniform samples. The reconstructed
surface is a smooth manifold passing through all the samlMe points. This surface is implicitly
represented as the zero-set of some pseudo-distance function. It can be meshed so as to
satisfy a user-defined error bound. Experimental results are presented for surfaces in R 3.
unorganised sample points and normals. The method uses natural neighbour interpolation,
works in any dimension and allows to deal with non uniform samples. The reconstructed
surface is a smooth manifold passing through all the samlMe points. This surface is implicitly
represented as the zero-set of some pseudo-distance function. It can be meshed so as to
satisfy a user-defined error bound. Experimental results are presented for surfaces in R 3.
Abstract
We present an algorithm to reconstruct smooth surfaces of arbitrary topology from unorganised sample points and normals. The method uses natural neighbour interpolation, works in any dimension and allows to deal with non uniform samples. The reconstructed surface is a smooth manifold passing through all the samlMe points. This surface is implicitly represented as the zero-set of some pseudo-distance function. It can be meshed so as to satisfy a user-defined error bound. Experimental results are presented for surfaces in R 3.