Surface reconstruction via contour metamorphosis: An eulerian approach with lagrangian particle tracking

Proceedings of the IEEE Visualization Conference

Volumn , Issue , 2005, Pages 52-

  Nilsson, Ola ^a   Breent, David ^b   Museth, Ken ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

^b DREXEL UNIVERSITY   (United States)

Author keywords

3D reconstruction; Contours; Level sets

Indexed keywords

3D RECONSTRUCTION; EULERIAN FORMULATION; MORPHING PROCESSES; SPLINE INTERPOLATIONS;

CONTOUR MEASUREMENT; DATA STRUCTURES; IMAGE SEGMENTATION; NUMERICAL METHODS; PROBLEM SOLVING; SCANNING; TOPOLOGY; TRACKING (POSITION);

SURFACE STRUCTURE;

EID: 33749445427     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/VIS.2005.95     Document Type: Conference Paper

References (44)

1. D. Adalsteinsson and J. A. Sethian. A fast level set method for propagating interfaces. J. Comput. Phys., 118(2):269-277, 1995.
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:524-543, 1996.
3. G. Barequet, D. Shapiro, and A. Tal. Multilevel sensitive reconstruction of polyhedral surfaces from parallel slices. The Visual Compouter, 16(2):116-133, 2000.
4. G. Barequet and M. Sharir. Piecewise-linear interpolation between polygonal slices. Computer Vision and Image Un deratanding, 63:251-272, 1996.
5. W. Barrett, E. Mortensen, and D. Taylor. An image space algorithm for morphological contour interpolation. In Proc. Graphics Interface, pages 16-24, 1994.
6. J.-D. Boissonnat. Shape reconstruction from planar cross sections. Computer Vision, Graphics, and Image Processing, 44(1):1-29, 1988.
7. D. Breen and R. Whitaker. A level set approach for the metamorphosis of solid models. IEEE Trans. on Visualization and Computer Graphics, 7(2):173-192, 2001.
8. J. Chai, T. Miyoshi, and E. Nakamae. Contour interpolation and surface reconstruction of smooth terrain models. In Proc. IEEE Visualization, pages 27-33, 1998.
9. D. Cohen-Or and D. Levin. Guided multi-dimensional reconstruction from cross-sections. In F. Fontanella, K. Jetter, and P.-J. Laurent, editors, Advanced Topics in Multivariate Approximation, pages 1-9. World Scientific Publishing Co., 1996.
10. D. Cohen-Or, D. Levin, and A. Solomovici. Contour blending using warp-guided distance field interpolation. In Proc. IEEE Visualization, pages 165-172, 1996.
11. M. Desbrun and M.-P. Cani-Gascuel. Active implicit surface for animation. In Graphics Interface, pages 143-150, 1998.
12. A.B. Ekoule, F.C. Peyrin, and C.L. Odet. A triangulation algorithm from arbitrary shaped multiple planar contours. ACM Transactions on Graphics, 10(2):182-199, 1991.
13. D. Enright, R. Fedkiw, J. Ferziger, and I. Mitchell. A hybrid particle level set method for improved interface capturing. J. Comput. Phys., 183(1):83-116, 2002.
14. H. Fuchs, Z.M. Kedem, and S.P. Uselton. Optimal surface reconstruction from planar contours. Communications of the ACM, 20(10):693-702, 1977.
15. K. Fujimura and E. Kuo. Shape reconstruction from contours using isotopic deformation. Graphical Models and Image Processing, 61:127-147, 1996.
16. S. Ganapathy and T.G. Dennehy. A new general triangulation method for planar contours. In Proc. SIGGRAPH '78, pages 69-75, 1978.
17. J. M. Hyman. Accurate monotonicity preserving cubic interpolation. SIAM Journal of Scientific and Statistical Computing, 4(4):645-654, 1983.
18. J. Johnstone and K.R. Sloan. Tensor product surfaces guided by minimal surface area triangulations. In Proc. IEEE Visualization, pages 254-261, 1995.
19. M. Jones and M. Chen. A new approach to the construction of surfaces from contour data. Computer Graphics Forum, 13(3):75-84, 1994.
20. E. Keppel. Approximating complex surface by triangulation of contour lines. IBM Journal of Research and Development, 19:2-11, 1975.
21. R. Klein, A.G. Schilling, and W. Strasser. Reconstruction and simplification of surfaces from contours. Graphical Models, 62:429-443, 2000.
22. D. Levin. Multidimensional reconstruction by set-valued approximation. IMA Journal of Numerical Analysis, 6:173-184, 1986.
23. X.-D. Liu, S. Osher, and T. Chan. Weighted essentially nonoscillatory schemes. J. Comput. Phys., 115:200-212, 1994.
24. W. E. Lorensen and H. E. Cline. Marching Cubes: A high resolution 3D surface construct ion algorithm. In Proc. SIGGRAPH '87, volume 21, pages 163-169, 1987.
25. D. Meyers, S. Skinner, and K. Sloan. Surfaces from contours. ACM Transactions on Graphics, 11(3):228-258, 1992.
26. K. Museth, D. Breen, R. Whitaker, S. Mauch, and D. Johnson. Algorithms for interactive editing of level set models. Computer Graphics Forum, accepted for publication, 2005.
27. K. Museth, D. Breen, L. Zhukov, and R. Whitaker. Level set segmentation from multiple non-uniform volume datasets. In Proc. IEEE Visualization 2002, pages 179-186, October 2002.
28. M. Nielsen and K. Museth. Dynamic Tubular Grid: An efficient data structure and algorithms for high resolution level sets. Linköping Electronic Articles in Computer and Information Science, 9(001):ISSN 1401-9841, 2004.
29. Accepted for publication in Journal of Scientific Computing January 26, 2005.
30. 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(3):397-408, 1996.
31. S. Osher and R. Fedkiw. Level Set Methods and Dynamic Implicit Surfaces. Springer, Berlin, 2002.
32. S. Osher and J. Sethian. Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations. Journal of Computational Physics, 79:12-49, 1988.
33. S. Osher and C.-W. Shu. High-order essentially nonoscillatory schemes for Hamilton-Jacobi equations. SIAM J. Num. Anal, 28:907-922, 1991.
34. D. Peng, B. Merriman, S. Osher, H. Zhao, and M. Kang. A PDE-based fast local level set method. J. Comput. Phys., 155(2):410-438, 1999. Pseudo code on page 418 has errors see instead our appendix A.
35. S.P. Raya and J.K. Udupa. Shape-based interpolation of multidimensional objects. IEEE Transactions on Medical Imaging, 9(1):32-42, 1990.
36. E. Rouy and A. Tourin. A viscosity solutions approach to shape-from-shading. SIAM J. Num. Anal., 29:867-884, 1992.
37. J. A. Sethian. A fast marching level set method for monotonically advancing fronts. Proc. of the National Academy of Sciences of the USA, 93(4):1591-1595, February 1996.
38. J. A. Sethian. Level Set Methods and Fast Marching Methods. Cambridge University Press, Cambridge, UK, second edition, 1999.
39. C.-W. Shu and S. Osher. Efficient implementation of essentially non-oscillatory shock capturing schemes. J. Comput. Phys., 77:439-471, 1988.
40. M. Sussman, P. Smereka, and S. Osher. A level set approach for computing solutions to incompressible two-phase flow. J. Comput. Phys., 114(1):146-159, 1994.
41. J. N. Tsitsiklis. Efficient algorithms for globally optimal trajectories. IEEE Trans. Automat. Contr., 40:1528-1538, September 1995.
42. R. Whitaker. A level-set approach to 3D reconstruction from range data. Int. J. Comput. Vision, 29(3):203-231, 1998.
43. G. Wolberg and I. Alfy. Monotonic cubic spline interpolation. In CGI '99: Proc. International Conference on Computer Graphics, page 188, 1999.
44. H.K. Zhao. Fast sweeping method for eikonal equations. Mathematics of Computation, 74:603-627, 2004.