Optimizing a Strip Separating Two Polygons

We consider the problem of finding a strip separating between two polygons, whose intersection with a third (convex) polygon is of maximum area. We present an optimal linear-time algorithm for computing the optimum strip. When the third polygon is not convex, the running time of the algorithm is quadratic in the size of the input. The application in mind is the piecewise-linear surface interpolation in simple branching cases, where the sought volume branches from one contour in one slice into two contours in the other slice.

[1]  Joseph O'Rourke,et al.  On reconstructing polyhedra from parallel slices , 1996, Int. J. Comput. Geom. Appl..

[2]  Thomas W. Sederberg,et al.  Conversion of complex contour line definitions into polygonal element mosaics , 1978, SIGGRAPH.

[3]  Nasser Kehtarnavaz,et al.  A syntactic/Semantic technique for surface reconstruction from cross-sectional contours , 1988, Comput. Vis. Graph. Image Process..

[4]  Heinrich Müller,et al.  Surface Interpolation from Cross Sections , 1991, Focus on Scientific Visualization.

[5]  Barbara Wolfers,et al.  Surface Reconstruction Between Simple Polygons via Angle Criteria , 1994, J. Symb. Comput..

[6]  S J Dwyer,et al.  Three-Dimensional Computer Reconstruction from Surface Contours for Head CT Examinations , 1981, Journal of computer assisted tomography.

[7]  S. Ganapathy,et al.  A new general triangulation method for planar contours , 1982, SIGGRAPH.

[8]  Michael Shantz,et al.  Surface definition for branching, contour-defined objects , 1981, COMG.

[9]  Jean-Daniel Boissonnat,et al.  Shape reconstruction from planar cross sections , 1988, Comput. Vis. Graph. Image Process..

[10]  Larry L. Schumaker,et al.  Reconstructing 3D Objects from Cross-Sections , 1990 .

[11]  Eric Keppel,et al.  Approximating Complex Surfaces by Triangulation of Contour Lines , 1975, IBM J. Res. Dev..

[12]  Jean-Daniel Boissonnat,et al.  Three-dimensional reconstruction of complex shapes based on the Delaunay triangulation , 1993, Electronic Imaging.

[13]  Kenneth R. Sloan,et al.  From contours to surfaces: testbed and initial results , 1986, CHI '87.

[14]  A. B. Ekoule,et al.  A triangulation algorithm from arbitrary shaped multiple planar contours , 1991, TOGS.

[15]  G. Toussaint.  Solving geometric problems with the rotating calipers , 1983 .

[16]  Micha Sharir,et al.  Piecewise-Linear Interpolation between Polygonal Slices , 1996, Comput. Vis. Image Underst..

[17]  Yuan-Fang Wang,et al.  Surface reconstruction and representation of 3-D scenes , 1986, Pattern Recognit..

[18]  Herbert Edelsbrunner,et al.  Computing the Extreme Distances Between Two Convex Polygons , 1985, J. Algorithms.

[19]  Edward J. Coyle,et al.  Arbitrary Topology Shape Reconstruction from Planar Cross Sections , 1996, CVGIP Graph. Model. Image Process..

[20]  Kenneth R. Sloan,et al.  Surfaces from contours , 1992, TOGS.

[21]  Nasser Kehtarnavaz,et al.  A framework for surface reconstruction from 3D contours , 1988, Comput. Vis. Graph. Image Process..

[22]  Avraham A. Melkman,et al.  On-Line Construction of the Convex Hull of a Simple Polyline , 1987, Inf. Process. Lett..

[23]  Henry Fuchs,et al.  Optimal surface reconstruction from planar contours , 1977, CACM.

[24]  Kenneth R. Sloan,et al.  Pessimal Guesses may be Optimal: A Counterintuitive Search Result , 1988, IEEE Trans. Pattern Anal. Mach. Intell..