Reconstruction and simplification of surfaces from contours

Graphical Models

Volumn 62, Issue 6, 2000, Pages 429-443

  Klein, Reinhard ^a   Schilling, Andreas ^a   Straßer, Wolfgang ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; THREE DIMENSIONAL COMPUTER GRAPHICS;

CORRESPONDENCE PROBLEM; MESH SIMPLIFICATION;

IMAGE RECONSTRUCTION;

EID: 0034324444     PISSN: 15240703     EISSN: None     Source Type: Journal    
DOI: 10.1006/gmod.2000.0530     Document Type: Article

References (30)

1. Barequet G., Sharir M. Piecewise-linear interpolation between polygonal slices. Comput. Vision Image Understand. 63:1996;251-272.
2. Boissonnat J.-D. Shape reconstruction from planar cross sections. Comput. Vision Graph. Image Process. 44:1988;1-29.
3. Christiansen H. N., Sederberg T. W. Conversion of complex contour line definitions into polygonal element mosaics. Comput. Graph. 12:1978;187-192.
4. Cignoni P., Montani C., Scopigno R. A comparison of mesh simplification algorithms. Comput. Graph. 22:1998.
5. Cohen J., Varshney A., Manocha D., Turk G. Simplification envelopes. Comput. Graph. 30:1996;119-128.
6. D. Cohen-Or, D. Levin, and, A. Solomovici, Contour blending using warp-guided distance field interpolation, in, IEEE Visualization '96, Oct. 1996, IEEE.
7. Cong G., Parvin B. An algebraic solution to surface recovery from cross-sectional contours. Graph. Models Image Process. 61:1999;222-243.
8. Fuchs H., Kedmen Z., Uselton S. Optimal surface resconstruction from planar contours. Comm. Assoc. Comput. Mach. 20:1977;693-702.
9. M. Garland and P. S. Heckbert, Surface simplification using quadric error metrics, in SIGGRAPH 97 Conference ProceedingsT. Whitted, Ed., pp. 209-216, Addison-Wesley, Reading, MA, 1997. [Annual conference series].
10. Herman G. T., Zheng J., Bucholtz C. A. Shape-based interpolation. IEEE Comput. Graph. Appl. 12:1992;69-79.
11. J. Hershberger and J. Snoeyink, Speeding up the Douglas-Peucker line-simplification algorithm, in Proc. 5th Intl. Symp. on Spatial Data Handling Charleston, SC, 1992P. Bresnahanet al., Eds., Vol. 1, pp. 134-143.
12. H. Hoppe, Progressive meshes, in SIGGRAPH 96 Conference ProceedingsH. Rushmeier, Ed., pp. 99-108, Addison-Wesley, Reading, MA, 1996. [Annual conference series].
13. K. Hoff, III, T. Culver, J. Keyser, M. Lin, and D. Manocha, Fast computation of generalized Voronoi diagrams using graphics hardware, in SIGGRAPH '99 Conference ProceedingsA. Rockwood, Ed., pp. 277-286, Addison-Wesley, Reading, MA, 1999.
14. Jones M. W., Chen M. A new approach to the construction of surfaces from contour data. Comput. Graph. Forum. 13:1994;C/75-C/84.
15. Keppel E. Approximating complex surfaces by triangulation of contour lines. IBM J. Res. Dev. 19:1975;2-11.
16. R. Klein, Abstract Voronoi diagrams and their applications, in Proceedings of the International Workshop on Computational Geometry and its ApplicationsH. Noltemeier, Ed., Lecture Notes in Computer Science, Vol. 333, pp. 148-157, Springer-Verlag, Berlin.
17. Klein R. Concrete and abstract Voronoi diagrams. Lecture Notes in Computer Science. 400:1989.
18. Klein R., Krämer J. Multiresolution representations for surface meshes. Proceedings of the SCCG (Spring Conference on Computer Graphics). Budmerice, Slovakia. 1997;57-66.
19. R. Klein, G. Liebich, and, W. Straßer, Mesh reduction with error control, in, IEEE Visualization '96, Oct. 1996, IEEE.
20. R. Klein, and, A. Schilling, Fast distance field interpolation for reconstruction of surfaces from contours, in, Eurographics '99, Short Papers & Demos Proceedings, Milano, Italy, 1999.
21. ∞) metrics with 2-dimensional storage applications. SIAM J. Comput. 9:1980;200-211.
22. Levin D. Multidimensional reconstruction by set-valued approximation. IMA J. Numer. Anal. 1986;173-184.
23. M. Lounsbery, C. Loop, S. Mann, D. Meyers, J. Painter, T. DeRose, and K. Sloan, Testhed for the comparison of parametric surface methods, in Curves and Surfaces in Computer Vision and Graphics (Proceedings of SPIE)L. A. Ferrari and R. J. P. de Figueiredo, Eds., Vol. 1251, pp. 94-105, Bellingham, Wash., 1990.
24. Meyers D., Skinner S., Sloan K. Surfaces from contours. ACM Trans. Graph. 11:1992;228-258.
25. H. Müller, Using graphics algorithms as subroutines in collision detection, in Graphics and RoboticsW. Straßer and F. Wahl, Eds., pp. 45-57, Springer-Verlag, Berlin/New York, 1995.
26. H. Müller and A. J. Klingert, Surface interpolation from cross sections, in Focus on Scientific VisualizationH. Hagen, H. Mueller, and G. Nielsen, Eds., pp. 139-190, Springer-Verlag, Berlin/NewYork, 1993.
27. Oliva J. M., Perrin M., Coquillart S. 3D reconstruction of complex polyhedral shapes from contours using a simplified generalized Voronoi diagram. Comput. Graph. Forum. 15:1996;C397-C408.
28. Payne B. A., Toga A. W. Distance field manipulation of surface models. IEEE Comput. Graph. Appl. 12:1992;65-71.
29. Ronfard R., Rossignac J. Full-range approximation of triangulated polyhedra. Comput. Graph. Forum. 15:1996;C67-C76.
30. L. Schumaker, Reconstructing 3D objects from crosssections, in Computation of Curves and SurfacesW. Dahmen, M. Gasca, and C. Micchelli, Eds., pp. 275-309. Kluwer Academic, Dordrecht/Norwell, MA, 1989.