SURFACES FROM CONTOURS

被引:242
作者
MEYERS, D
SKINNER, S
SLOAN, K
机构
[1] UNIV WASHINGTON, DEPT COMP SCI, SEATTLE, WA 98195 USA
[2] UNIV ALABAMA, DEPT COMP & INFORMAT SCI, BIRMINGHAM, AL 35294 USA
来源
ACM TRANSACTIONS ON GRAPHICS | 1992年 / 11卷 / 03期
关键词
ALGORITHMS; BRANCHING PROBLEM; BRANCHING SURFACES; CORRESPONDENCE PROBLEM; MESHES; MINIMUM SPANNING TREE; SURFACE FITTING; SURFACE RECONSTRUCTION; TILING;
D O I
10.1145/130881.131213
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
This paper is concerned with the problem of reconstructing the surfaces of three-dimensional objects, given a collection of planar contours representing cross-sections through the objects. This problem has important applications in biomedical research and instruction, solid modeling, and industrial inspection. The method we describe produces a triangulated mesh from the data points of the contours which is then used in conjunction with a piecewise parametric surface-fitting algorithm to produce a reconstructed surface. The problem can be broken into four subproblems: the correspondence problem (which contours should be connected by the surface?), the tiling problem (how should the contours be connected?), the branching problem (what do we do when there are branches in the surface?), and the surface-fitting problem (what is the precise geometry of the reconstructed surface?). We describe our system for surface reconstruction from sets of contours with respect to each of these subproblems. Special attention is given to the correspondence and branching problems. We present a method that can handle sets of contours in which adjacent contours share a very contorted boundary, and we describe a new approach to solving the correspondence problem using a Minimum Spanning Tree generated from the contours.
引用
收藏
页码:228 / 258
页数:31
相关论文
共 26 条
  • [1] SHAPE RECONSTRUCTION FROM PLANAR CROSS-SECTIONS
    BOISSONNAT, JD
    [J]. COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1988, 44 (01): : 1 - 29
  • [2] TRIANGULATION AND SHAPE-COMPLEXITY
    CHAZELLE, B
    INCERPI, J
    [J]. ACM TRANSACTIONS ON GRAPHICS, 1984, 3 (02): : 135 - 152
  • [3] CHEW LP, 1989, ALGORITHMICA, V4, P97, DOI 10.1007/BF01553881
  • [4] CHRISTIANSEN HN, 1978, COMPUT GRAPH, V12, P187
  • [5] AN ALGORITHM FOR VOLUME ESTIMATION BASED ON POLYHEDRAL APPROXIMATION
    COOK, LT
    COOK, PN
    LEE, KR
    BATNITZKY, S
    WONG, BYS
    FRITZ, SL
    OPHIR, J
    DWYER, SJ
    BIGONGIARI, LR
    TEMPLETON, AW
    [J]. IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, 1980, 27 (09) : 493 - 500
  • [6] Duda R. O., 1973, PATTERN CLASSIFICATI, V3
  • [7] A TRIANGULATION ALGORITHM FROM ARBITRARY SHAPED MULTIPLE PLANAR CONTOURS
    EKOULE, AB
    PEYRIN, FC
    ODET, CL
    [J]. ACM TRANSACTIONS ON GRAPHICS, 1991, 10 (02): : 182 - 199
  • [8] Farin G., 1993, CURVES SURFACES COMP
  • [9] TRIANGULATING SIMPLE POLYGONS AND EQUIVALENT PROBLEMS
    FOURNIER, A
    MONTUNO, DY
    [J]. ACM TRANSACTIONS ON GRAPHICS, 1984, 3 (02): : 153 - 174
  • [10] OPTIMAL SURFACE RECONSTRUCTION FROM PLANAR CONTOURS
    FUCHS, H
    KEDEM, ZM
    USELTON, SP
    [J]. COMMUNICATIONS OF THE ACM, 1977, 20 (10) : 693 - 702