Straight-skeleton based contour interpolation

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 119-127

  Barequet, Gill ^a   Goodrich, Michael T ^b   Levi Steiner, Aya ^a   Steiner, Dvir ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GEOGRAPHIC INFORMATION SYSTEMS; IMAGE RECONSTRUCTION; INTERPOLATION; MEDICAL IMAGING; NUMBER THEORY; PIECEWISE LINEAR TECHNIQUES;

CONTOUR INTERPOLATION; PIECEWISE LINEAR INTERPOLATION; SURFACE RECONSTRUCTION;

COMPUTATIONAL GEOMETRY;

EID: 0038078080     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. O. Aichholzer, D. Alberts, F. Aurenhammer, and B. Gärtner, A novel type of skeleton for polygons, J. of Universal Computer Science, 1 (1995), 752-761.
2. C.L. Bajaj, E.J. Coyle, and K.N. Lin, Arbitrary topology shape reconstruction from planar cross sections, Graphical Models and Image Processing, 58 (1996), 524-543.
3. G. Barequet, M.T. Dickerson, and M.T. Goodrich, Voronoi diagrams for polygon-offset distance functions, Discrete & Computational Geometry, 25 (2001), 271-291.
4. G. Barequet, D. Shapiro, and A. Tal, Multilevel sensitive reconstruction of polyhedral surfaces from parallel slices, The Visual Computer, 16 (2000), 116-133.
5. G. Barequet and M. Sharir, Piecewise-linear interpolation between polygonal slices, Computer Vision and Image Understanding, 63 (1996), 251-272.
6. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications, Springer-Verlag, Germany, 1997.
7. J.D. Boissonnat, Shape reconstruction from planar cross sections, Computer Vision, Graphics and Image Processing, 44 (1988), 1-29.
8. J.D. Boissonnat and B. Geiger, Three dimensional reconstruction of complex shapes based on the Delaunay triangulation, Technical Report 1697, Inria-Sophia Antipolis, 1992.
9. S.W. Cheng and T.K. Dey, Improved construction of Delaunay based contour surfaces, Proc. ACM Symp. on Solid Modeling and Applications, 322-323, 1999.
10. S.-W. Cheng and A. Vigneron, Motorcycle graphs and straight skeletons, Proc. 13th ACM/SIAM Symp. on Discrete Algorithms, 156-165, 2002.
11. Y.K. Choi and K.H. Park, A heuristic triangulation algorithm for multiple planar contours using an extended double branching procedure, The Visual Computer, 10 (1994), 372-387.
12. H.N. Christiansen and T.W. Sederberg, Conversion of complex contour line definitions into polygonal element mosaics, Computer Graphics, 13 (1978), 187-192.
13. P. Felkel and Š. Obdržálek, Straight skeleton computation, Spring Conf. on Computer Graphics, Budmerice, Slovakia, 210-218, 1998.
14. P. Felkel and Š. Obdržálek, Improvement of Oliva's algorithm for surface reconstruction from contours, Spring Conf. on Computer Graphics, Budmerice, Slovakia, 254-263, 1999.
15. D. Eppstein and J. Erickson, Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions, Disc. & Comp. Geometry, 22 (1999), 569-592.
16. H. Fuchs, Z.M. Kedem, and S.P. Uselton, Optimal surface reconstruction from planar contours, Communications of the ACM, 20 (1977), 693-702.
17. S. Ganapathy and T.G. Dennehy, A new general triangulation method for planar contours, ACM Trans. on Computer Graphics, 16 (1982), 69-75.
18. N. Kehtarnavaz and R.J.P. de Figueiredo, A framework for surface reconstruction from 3D contours, Computer Vision, Graphics and Image Processing, 42 (1988), 32-47.
19. N. Kehtarnavaz, L.R. Simar, and R.J.P. de Figueiredo, A syntactic/semantic technique for surface reconstruction from cross-sectional contours, Computer Vision, Graphics and Image Processing, 42 (1988), 399-409.
20. E. Keppel, Approximating complex surfaces by triangulation of contour lines, IBM Journal of Research and Development, 19 (1975), 2-11.
21. D. Meyers, S. Skinner, and K. Sloan, Surfaces from contours: The correspondence and branching problems, Proc. Graphics Interface, 246-254, 1991.
22. J.-M. Oliva, M. Perrin, and S. Coquillart, 3D reconstruction of complex polyhedral shapes from contours using a simplified generalized Voronoi diagram, Computer Graphics Forum, 15 (1996), C397-408.
23. M. Shantz, Surface definition for branching contour-defined objects, Computer Graphics, 15 (1981), 242-270.
24. K.R. Sloan and J. Painter, Pessimal guesses may be optimal: A counterintuitive search result, IEEE T-PAMI, 10 (1988), 949-955.
25. Y.F. Wang and J.K. Aggarwal, Surface reconstruction and representation of 3-D scenes, Pattern Recognition, 19 (1986), 197-207.
26. E. Welzl and B. Wolfers, Surface reconstruction between simple polygons via angle criteria, J. of Symbolic Computation, 17 (1994), 351-369.
27. M.J. Zyda, A.R. Jones, and P.G. Hogan, Surface construction from planar contours, Computers and Graphics, 11 (1987), 393-408.