Contour interpolation by straight skeletons

Graphical Models

Volumn 66, Issue 4, 2004, Pages 245-260

  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

Piecewise linear interpolation; Surface reconstruction

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BIOLOGICAL ORGANS; COMPUTATIONAL GEOMETRY; GEOGRAPHIC INFORMATION SYSTEMS; INTERPOLATION; MEDICAL IMAGING; SENSORS; SURFACE TOPOGRAPHY;

COMPUTING CELLS; CONTOUR INTERPOLATION; PIECEWISE-LINEAR INTERPOLATION; SURFACE RECONSTRUCTION;

CONTOUR MEASUREMENT;

GRAPHICAL METHOD;

EID: 3342950480     PISSN: 15240703     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.gmod.2004.05.001     Document Type: Article

References (33)

1. O. Aichholzer, D. Alberts, F. Aurenhammer, B. Gärtner, A novel type of skeleton for polygons, J. Universal Comput. Sci. l (1995) 752-761.
2. C.L. Bajaj, E.J. Coyle, K.N. Lin, Arbitrary topology shape reconstruction from planar cross sections, Graph. Models Image Process. 58 (1996) 524-543.
3. I.J. Balaban, An optimal algorithm for finding segment intersections, in: Proceedings of the 11th Annual ACM Symposium on Computational Geometry, Vancouver, British Columbia, Canada, 1995, pp. 211-219.
4. G. Barequet, M.T. Dickerson, M.T. Goodrich, Voronoi diagrams for polygon-offset distance functions, Discrete Comput. Geom. 25 (2001) 271-291.
5. G. Barequet, M.T. Goodrich, A. Levi-Steiner, D. Steiner, Straight-skeleton based contour interpolation, in: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, 2003, pp. 119-127.
6. G. Barequet, D. Shapiro, A. Tal, Multilevel sensitive reconstruction of polyhedral surfaces from parallel slices, Visual Comput. 16 (2000) 116-133.
7. G. Barequet, M. Sharir, Piecewise-linear interpolation between polygonal slices, Comput. Vision Image Understanding 63 (1996) 251-272.
8. S. Batnitzky, H.I. Price, P.N. Cook, L.T. Cook, S.J. Dwyer III, Three-dimensional computer reconstruction from surface contours for head CT examinations, J. Comput. Assisted Tomography 5 (1981) 60-67.
9. M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf, Computational Geometry: Algorithms and Applications, Springer-Verlag, Germany, 1997.
10. J.D. Boissonnat, Shape reconstruction from planar cross sections, Comput. Vision Graph. Image Process. 44 (1988) 1-29.
11. J.D. Boissonnat, B. Geiger, Three dimensional reconstruction of complex shapes based on the Delaunay triangulation, Technical Report 1697, Inria-Sophia Antipolis, 1992.
12. S.W. Cheng, T.K. Dey, Improved construction of Delaunay based contour surfaces, in: Proceedings of the 5th ACM Symposium on Solid Modeling and Applications, Ann Arbor, MI, 1999, pp. 322-323.
13. S.-W. Cheng, A. Vigneron, Motorcycle graphs and straight skeletons, in: Proceedings of the 13th ACM/SIAM Symposium on Discrete Algorithms, San Francisco, CA, 2002, pp. 156-165.
14. Y.K. Choi, K.H. Park, A heuristic triangulation algorithm for multiple planar contours using an extended double branching procedure, Visual Comput. 10 (1994) 372-387.
15. H.N. Christiansen, T.W. Sederberg, Conversion of complex contour line definitions into polygonal element mosaics, Comput. Graph. 13 (1978) 187-192.
16. A.B. Ekoule, F.C. Peyrin, C.L. Odet, A triangulation algorithm from arbitrary shaped multiple planar contours, ACM Trans. Graph. 10 (1991) 182-199.
17. D. Eppstein, J. Erickson, Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions, Discrete Comput. Geom. 22 (1999) 569-592.
18. P. Felkel, Š. Obdržálek, Straight skeleton computation, in: L. Szirmay-Kalos (Ed.), Spring Conference on Computer Graphics, Budmerice, Slovakia, 1998, pp. 210-218.
19. P. Felkel, Š. Obdržálek, Improvement of Oliva's algorithm for surface reconstruction from contours, in: J. Zara (Ed.), Spring Conference on Computer Graphics, Budmerice, Slovakia, 1999, pp. 254-263.
20. J.D. Fix, R.E. Ladner, Multiresolution banded refinement to accelerate surface reconstruction from polygons, in: Proceedings of the 14th Annual ACM Symposium on Computational Geometry, Minneapolis, MN, 1998, pp. 240-248.
21. H. Fuchs, Z.M. Kedem, S.P. Uselton, Optimal surface reconstruction from planar contours, Commun. ACM 20 (1977) 693-702.
22. S. Ganapathy, T.G. Dennehy, A new general triangulation method for planar contours, ACM Trans. Comput. Graph. 16 (1982) 69-75.
23. L. Guibas, J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, ACM Trans. Graph. 4 (1985) 74-123.
24. N. Kehtarnavaz, R.J.P. De Figueiredo, A framework for surface reconstruction from 3D contours, Comput. Vision Graph. Image Process. 42 (1988) 32-47.
25. N. Kehtarnavaz, L.R. Simar, R.J.P. De Figueiredo, A syntactic/semantic technique for surface reconstruction from cross-sectional contours, Comput. Vision Graph. Image Process. 42 (1988) 399-409.
26. E. Keppel, Approximating complex surfaces by triangulation of contour lines, IBM J. Res. Dev. 19 (1975)2-11.
27. D. Meyers, S. Skinner, K. Sloan, Surfaces from contours: the correspondence and branching problems, Proc. Graph. Interface (1991) 246-254.
28. J.-M. Oliva, M. Perrin, S. Coquillart, 3D reconstruction of complex polyhedral shapes from contours using a simplified generalized Voronoi diagram, Comput. Graph. Forum 15 (1996) C397-408.
29. M. Shantz, Surface definition for branching contour-defined objects, Comput. Graph. 15 (1981) 242-270.
30. K.R. Sloan, J. Painter, Pessimal guesses may be optimal: a counterintuitive search result, IEEE Trans. Pattern Anal. Mach. Intell. 10 (1988) 949-955.
31. Y.F. Wang, J.K. Aggarwal, Surface reconstruction and representation of 3-D scenes, Pattern Recogn. 19 (1986) 197-207.
32. E. Welzl, B. Wolfers, Surface reconstruction between simple polygons via angle criteria, J. Symbolic Comput. 17 (1994) 351-369.
33. M.J. Zyda, A.R. Jones, P.G. Hogan, Surface construction from planar contours, Comput. Graph. 11 (1987) 393-408.