Beta-connection: Generating a family of models from planar cross sections

ACM Transactions on Graphics

Volumn 24, Issue 4, 2005, Pages 1239-1258

  Nonato, Luis Gustavo ^a   Cuadros Vargas, Alex Jesus ^a   Minghim, Rosane ^a   De Oliveira, Maria Cristina F ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

3D reconstruction; Cross sections; Delaunay triangulation

Indexed keywords

3D RECONSTRUCTIONS; BETA CONNECTIONS; CROSS SECTIONS; DELAUNAY TRIANGULATIONS;

COMPUTER SIMULATION; DATA PROCESSING; IMAGE RECONSTRUCTION; MODELS; PARAMETER ESTIMATION; THREE DIMENSIONAL;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 33645793292     PISSN: 07300301     EISSN: 07300301     Source Type: Conference Proceeding    
DOI: 10.1145/1095878.1095879     Document Type: Article

References (21)

1. AURENHAMMER, F. 1991. Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Comput. Surv. 23, 3, 345-405.
2. BAJAJ, C., COYLE, E., AND LIN, K. 1996. Arbitrary topology shape reconstruction from planar cross sections. Graph. Models Image Process. 58, 6, 524-543.
3. BAJAJ, C., COYLE, E., AND LIN, K. 1999. Tetrahedral meshes from planar cross-sections. Comput. Meth. Appl. Mech. Eng. 179, 31-52.
4. BAREQUET, G. AND SHARIR, M. 1996. Piecewise-linear interpolation between polygonal slices. Comput. Vision Image Understand. 63, 2, 251-272.
5. BOISSONNAT, J.-D. 1988. Shape reconstruction from planar cross sections. Comput. Vision Graph. Image Process. 44, 1-29.
6. CHENG, S.-W. AND DEY, T. 1999. Improved constructions of delaunay-based contour surfaces. In ACM Symposium on Solid Modeling and Applications. ACM Press, New York, NY. 322-323.
7. CHRISTIANSEN, H. AND SEDERBERG, T. 1978. Conversion of complex contour line definitions into polygonal element mosaics. Comput. Graph. 12, 3, 187-192.
8. CORMEN, T., LEISERSON, C., AND RIVEST, R. 1997. Introduction to Algorithms. Electrical Engineering and Computer Science Series. MIT Press, Cambridge, MA.
9. EDELSBRUNNER, H. AND MÜCKE, E. P. 1994. Three-dimensional alpha shapes. ACM Trans. Graph. 13, 1, 43-72.
10. EKOULE, A., PEYRIN, F., AND ODET, C. 1991. A triangulation algorithm from arbitrary shaped multiple planar contours. ACM Trans. Graph. 10, 2, 182-199.
11. FORTUNE, S. 1992. Voronoi diagrams and delaunay triangulation. In Computing in Euclidean Geometry, D.-Z. Du and F. Hwang, Eds. Lecture Notes Series on Computing, Vol. 1. World Scientific Publishing Company, Singapore, 193-233.
12. GEIGER, B. 1993. Three dimensional modeling of human organs and its application to diagnosis and surgical planning. Tech. rep. 2105, INRIA, Sophia-Antipolis, France.
13. JONES, M. AND CHEN, M. 1994. A new approach to the construction of surfaces from contour data. Comput. Graph. For. 13, 3, 75-84.
14. KAUFMAN, A. 1998. Volume visualization: Principles and advances. In SIGGRAPH'98, Course Notes 24.
15. KEPPEL, E. 1975. Approximating complex surface by triangulation of contour lines. IBM J. Res. Devel. 19, 2-11.
16. LORENSEN, W. AND CLINE, H. 1987. Marching cubes: A high resolution 3d surface construction algorithm. ACM Comput. Graph. 21, 163-169.
17. MEYERS, D., SKINNER, S., AND SLOAN, K. 1992. Surfaces from contours. ACM Trans. Graph. 11, 3, 228-258.
18. NONATO, L., MINGHIM, R., OLWEIRA, M., AND TAVARES, G. 2001. A novel approach for Delaunay 3d reconstruction with a comparative analysis in the light of applications. Comput. Graph. For. 20, 2, 161-174.
19. SCHRÖEDER, W., MARTIN, K., AND LORENSEN, W. 2002. Visualization Toolkit, An Object-Oriented Approach to 3D Graphics 3rd Ed. Kitware Inc., New York, NY.
20. SHINAGAWA, Y. AND KUNII, T. 1991. The homotopy model: A generalized model for smooth surface generation from cross sectional data. Visual Comput. 7, 72-86.
21. SINGH, A., GOLDGOF, D., AND TERZOPOULOS, D., EDS. 1998. Deformable Models in Medical Image Analysis. IEEE Computer Society Press.