Smooth-surface reconstruction in near-linear time

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 781-790

  Funke, Stefan ^a   Ramos, Edgar A ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS;

INPUT SIZE; NEAR-LINEAR TIME; PIECEWISE LINEAR APPROXIMATIONS; RUNNING TIME; SAMPLE POINT; SMOOTH SURFACE; SURFACE RECONSTRUCTION ALGORITHMS; VORONOI DIAGRAMS;

SURFACE RECONSTRUCTION;

EID: 84892219489     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. N. Amenta and M. Bern. Surface reconstruction by Voronoi filtering. Disc.Comput. Geom. 22 (1999), 481-504. Earlier version appeared in Proc. 14th ACM Sympos. Comput. Geom., 39-48, 1998.
2. N. Amenta, S. Choi, T. K. Dey and N. Leekha. A simple algorithm for homeomorphic surface reconstruction. In Proc. 16th ACM Sympos. Comput. Geom. (SoCG 00), 213-222, 2000. To appear in Int. J. Comput. Geom. Appl.
3. N. Amenta, S. Choi and R K. Kolluri. The Power Crust, Union of Balls, and the Medial Axis Transform. Submitted to Int. J. Comput. Geom.
4. S. Arya, D. M. Mount, N. S. Netanyahu and R. Silverman. An optimal algorithm for approximate nearest neighbor searching in fixed dimension. J. ACM 45(6):891-923, (1998).
5. F. Bemardini, J. Mittleman, H. Rushmeier, C. Silva and G. Taubin. The ball-pivoting algorithm for surface reconstruction. In IEEE Trans. Visualization Comput. Graphics S (1999), 349-359.
6. J. D. Boissonat. Geometric structures for three-dimensional shape reconstruction. ACM Trans. Graphics 3 (1984) 266-286.
7. J. D. Boissonat and F. Cazals. Smooth surface reconstruction vial natural neighbor interpolation of distance functions. In Proc. 16th ACM Sympos. Comput. Geom. (SoCG 00), 223-232, 2000.
8. P. Callahan and R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest neighbors and n-body potential fields./ACM 42 (1995), 67-90.
9. T. M. Chan, J. Snoeyink, and C.-K. Yap. Output sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three. In Proc. 6th ACM-SIAM Sympos. Discr. Algorithms (SODA 95), 282-291, 1995. Journal version in Disc. Comput. Geom.
10. B. Curless and M. Levoy. A volumetric method for building complex models from range images. In Proc. ACM Siggraph, 303-312, 1996.
11. T. K. Dey, S. Funke and E. A. Ramos. Surface Reconstruction in Almost Linear Tune under Locally Uniform Sampling. European Workshop on Computational Geometry, Berlin, March 2001.
12. C. A. Duncan, M. T. Goodrich and S. G. Kobourov. Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees. In Proc. 9th ACM-SIAM Sympos. Discr. Algorithms (SODA 98), 1998.
13. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer Verlag, Heidelberg, 1987.
14. H. Edelsbrunner and N. Shah. Triangulating topological spaces. In Proc. 10th ACM Sympos. Comput. Geom. (SoCG 94), 285-292, 1994.
15. J. Erickson. Nice point sets can have nasty Delaunay triangulations. Proc. 17th ACM Sympos. Comput. Geom. (SoCG 01), 96-105, 2001.
16. M. Gopi, S. Krishnan and C. T. Silva. Surface reconstruction based on lower dimensional localized Delaunay triangulation. In Eurographics 2000, M. Gross and F. R. A. Hopgood (Guest Eds.) Blackwell Publishers, 2000.
17. H. Hoppe, T.Derose, T. Duchamp, J. McDonald and W. Stuet-zle. Surface reconstruction from unorganized point clouds. In Proc. of ACM Siggraph. 71-78, 1992.