Filling holes in complex surfaces using volumetric diffusion

被引:219
作者
Davis, J [1 ]
Marschner, SR [1 ]
Garr, M [1 ]
Levoy, M [1 ]
机构
[1] Stanford Univ, Dept Comp Sci, Stanford, CA 94305 USA
来源
FIRST INTERNATIONAL SYMPOSIUM ON 3D DATA PROCESSING VISUALIZATION AND TRANSMISSION | 2002年
关键词
D O I
10.1109/TDPVT.2002.1024098
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We address the problem of building watertight 3D models from surfaces that contain holes - for example, sets of range scans that observe most but not all of a surface. We specifically address situations in which the holes are too geometrically and topologically complex to fill using triangulation algorithms. Our solution begins by constructing a signed distance function, the zero set of which defines the surface. Initially, this function is defined only in the vicinity of observed surfaces. We then apply a diffusion process to extend this function through the volume until its zero set bridges whatever holes may be present. If additional information is available, such as known-empty regions of space inferred from the lines of sight to a 3D scanner, it can be incorporated into the diffusion process. Our algorithm is simple to implement, is guaranteed to produce manifold non-interpenetrating surfaces, and is efficient to run on large datasets because computation is limited to areas near holes.
引用
收藏
页码:428 / 438
页数:11
相关论文
共 29 条
  • [1] AMENTA N, 1998, P SIGGRAPH 98 ACM
  • [2] BAJAJ CL, 1995, P SIGGRAPH 95 ACM
  • [3] BERNARDINI F, 1999, IEEE T VISUALIZA OCT
  • [4] BERTALMIO M, 2000, P SIGGRAPH 2000 ACM
  • [5] CARR JC, 2001, P SIGGRAPH 2001 ACM
  • [6] CHEN Y, 1995, COMPUTER VISION IMAG, V61
  • [7] Curless B., 1996, P SIGGRAPH 96 ACM
  • [8] CURLESS BL, 1997, THESIS STANFORD U
  • [9] DEY TK, 2001, P S PAR LARG DAT VIS
  • [10] DINH H, P ICCV 2001