Computing and rendering point set surfaces

被引:731
作者
Alexa, M
Behr, J
Cohen-Or, D
Fleishman, S
Levin, D
Silva, CT
机构
[1] Tech Univ Darmstadt, Interact Graph Syst Grp, Dept Comp Sci, D-64283 Darmstadt, Germany
[2] Comp Graph Ctr, D-64283 Darmstadt, Germany
[3] Tel Aviv Univ, Sch Comp Sci, IL-69978 Tel Aviv, Israel
[4] Tel Aviv Univ, Sch Math Sci, Dept Math Appl, IL-69978 Tel Aviv, Israel
[5] AT&T Labs Res, Florham Pk, NJ 07932 USA
关键词
surface representation and reconstruction; moving least squares; point sample rendering; 3D acquisition;
D O I
10.1109/TVCG.2003.1175093
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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.
引用
收藏
页码:3 / 15
页数:13
相关论文
共 56 条
[1]  
Alexander M, 2001, INTERNETWEEK, P21
[2]  
Amenta N., 1998, Computer Graphics. Proceedings. SIGGRAPH 98 Conference Proceedings, P415, DOI 10.1145/280814.280947
[3]  
BAJAJ CL, 1995, P SIGGRAPH, P109
[4]   A HIERARCHICAL O(N-LOG-N) FORCE-CALCULATION ALGORITHM [J].
BARNES, J ;
HUT, P .
NATURE, 1986, 324 (6096) :446-449
[5]   The ball-pivoting algorithm for surface reconstruction [J].
Bernardini, F ;
Mittleman, J ;
Rushmeier, H ;
Silva, C ;
Taubin, G .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 1999, 5 (04) :349-359
[6]   A METHOD FOR REGISTRATION OF 3-D SHAPES [J].
BESL, PJ ;
MCKAY, ND .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1992, 14 (02) :239-256
[7]   GEOMETRIC STRUCTURES FOR 3-DIMENSIONAL SHAPE REPRESENTATION [J].
BOISSONNAT, JD .
ACM TRANSACTIONS ON GRAPHICS, 1984, 3 (04) :266-286
[8]   POP: A hybrid point and polygon rendering system for large data [J].
Chen, BQ ;
Nguyen, MX .
VISUALIZATION 2001, PROCEEDINGS, 2001, :45-52
[9]   A comparison of mesh simplification algorithm [J].
Cignoni, P ;
Montani, C ;
Scopigno, R .
COMPUTERS & GRAPHICS-UK, 1998, 22 (01) :37-54
[10]   Hybrid simplification: Combining multi-resolution polygon and point rendering [J].
Cohen, JD ;
Aliaga, DG ;
Zhang, WQ .
VISUALIZATION 2001, PROCEEDINGS, 2001, :37-44