TY - JOUR
T1 - Computing and rendering point set surfaces
AU - Alexa, Marc
AU - Behr, Johannes
AU - Cohen-Or, Daniel
AU - Fleishman, Shachar
AU - Levin, David
AU - Silva, Claudio T.
N1 - Funding Information:
We gratefully acknowledge the helpful comments of Markus Gross, Jörg Peters, Ulrich Reif, and several anonymous reviewers. This work was supported by a grant from the Israeli Ministry of Science, a grant from GIF (German Israeli Foundation), and a grant from the Israeli Academy of Sciences (center of excellence). The bunny model is courtesy of the Stanford Computer Graphics Laboratory. The angel statue in Fig. 1 was scanned by Peter Neugebauer at Fraunhofer IGD in Darmstadt, Germany using a structured light scanner and the QTSculptor system.
PY - 2003/1
Y1 - 2003/1
N2 - We advocate the use of point sets to represent shapes. We provide a definition of a smooth manifold surface from a set of points close to the original surface. The definition is based on local maps from differential geometry, which are approximated by the method of moving least squares (MLS). The computation of points on the surface is local, which results in an out-of-core technique that can handle any point set. We show that the approximation error is bounded and present tools to increase or decrease the density of the points, thus allowing an adjustment of the spacing among the points to control the error. To display the point set surface, we introduce a novel point rendering technique. The idea is to evaluate the local maps according to the image resolution. This results in high quality shading effects and smooth silhouettes at interactive frame rates.
AB - We advocate the use of point sets to represent shapes. We provide a definition of a smooth manifold surface from a set of points close to the original surface. The definition is based on local maps from differential geometry, which are approximated by the method of moving least squares (MLS). The computation of points on the surface is local, which results in an out-of-core technique that can handle any point set. We show that the approximation error is bounded and present tools to increase or decrease the density of the points, thus allowing an adjustment of the spacing among the points to control the error. To display the point set surface, we introduce a novel point rendering technique. The idea is to evaluate the local maps according to the image resolution. This results in high quality shading effects and smooth silhouettes at interactive frame rates.
KW - 3D acquisition
KW - Moving least squares
KW - Point sample rendering
KW - Surface representation and reconstruction
UR - http://www.scopus.com/inward/record.url?scp=0037285317&partnerID=8YFLogxK
U2 - 10.1109/TVCG.2003.1175093
DO - 10.1109/TVCG.2003.1175093
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0037285317
SN - 1077-2626
VL - 9
SP - 3
EP - 15
JO - IEEE Transactions on Visualization and Computer Graphics
JF - IEEE Transactions on Visualization and Computer Graphics
IS - 1
ER -