Greedy beta-skeleton in three dimensions

Proceedings - ISVD 2007 The 4th International Symposium on Voronoi Diagrams in Science and Engineering 2007

Volumn , Issue , 2007, Pages 101-109

  Hiyoshi, Hisamoto ^a  

^a GUNMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EXPERIMENTS; PRACTICAL METHODS; SAMPLING DENSITIES; SMOOTH CURVES; THREE DIMENSIONS; TWO DIMENSIONS; UNORGANIZED POINTS;

EID: 47849111891     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISVD.2007.27     Document Type: Conference Paper

References (21)

1. E. Althaus and K. Mehlhorn. Traveling salesman-based curve reconstruction in polynomial time. SIAM Journal on Computing, 31:27-66, 2001.
2. N. Amenta and M. Bern. Surface reconstruction by Voronoi filtering. Discrete and Computational Geometry, 22:481-504, 1999.
3. N. Amenta, M. Bern, and D. Eppstein. The crust and the beta-skeleton: combinatorial curve reconstruction. Graphical Models and Image Processing, 60:125-135, 1998.
4. N. Amenta, S. Choi, T. K. Dey, and N. Leekha. A simple algorithm for homeomorphic surface reconstruction. International Journal of Computational Geometry and Applications, 12:125-141, 2002.
5. D. Attali. r-regular shape reconstruction from unorganized points. Computational Geometry: Theory and Applications, 10:239-247, 1998.
6. F. Bernardini and C. L. Bajaj. Sampling and reconstructing manifolds using á-shapes. In Proceedings of the 9th Canadian Conference on Computational Geometry, pages 193-198, 1997.
7. J.-D. Boissonnat. Geometric structures for three-dimensional shape representation. ACM Transactions on Graphics, 3:266-286, 1984.
8. J.-D. Boissonnat and F. Cazals. Smooth surface reconstruction via natural neighbour interpolation of distance functions. Computational Geometry: Theory and Applications, 22:185-203, 2002.
9. J. Brandt and V. R. Algazi. Continuous skeleton computation by Voronoi diagram. Computer Vision, Graphics, and Image Processing, 55:329-338, 1992.
10. http://www.cgal.org/.
11. D. Cohen-Steiner and F. Da. A greedy Delaunay-based surface reconstruction algorithm. The Visual Computer, 20:4-16, 2004.
12. L. H. de Figueiredo and J. M. Gomes. Computational morphology of curves. Visual Computer, pages 105-112, 1995.
13. T. K. Dey and P. Kumar. A simple provable algorithm for curve reconstruction. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 893-894, Baltimore, Maryland, 1999.
14. T. K. Dey, K. Mehlhorn, and E. A. Ramos. Curve reconstruction: connecting dots with good reason. Computational Geometry: Theory and Applications, 15:229-244, 2000.
15. T. K. Dey and R. Wenger. Reconstructing curves with sharp corners. Computational Geometry: Theory and Applications, 19:89-99, 2001.
16. J. Giesen. Curve reconstruction, the traveling salesman problem, and menger's theorem on length. Discrete and Computational Geometry, 24:577-603, 2000.
17. H. Hiyoshi. Closed curve reconstruction from unorganized sample points. In Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering, pages 122-131, Banff, Alberta, Canada, 2006.
18. http://research.microsoft.com/ hoppe/.
19. D. G. Kirkpatrick and J. D. Radke. A framework for computational morphology. In G. Toussaint, editor, Computational Geometry, pages 217-248. North-Holland, Amsterdam, 1985.
20. J. O'Rourke, H. Booth, and R. Washington. Connect-the-dots: a new heuristic. Computer Vision, Graphics, and Image Processing, 39:258-266, 1987.
21. http://graphics.stanford.edu/data/3Dscanrep/.