Connect the Dots: The Reconstruction of Region Boundaries from Contour Sampling Points
Twodimensional contour reconstruction from a set of points is a very common problem not only in computer vision. I.e. in graph theory one may ask for the minimal spanning tree or the shortest Hamiltonian graph. In psychology the question arises under which circumstances people are able to recognize certain contours given only a few points. In the context of discrete geometry, there exist a lot of algorithms for 2D contour reconstruction from sampling points. Here a commonly addressed problem is to define an algorithm for which it can be proved that the reconstuction result resembles the original contour if this has been sampled according to certain density criteria. Most of these algorithms can not properly deal with background noise like humans can do. This paper gives an overview of the most important algorithms for contour reconstruction and shows that a relatively new algorithm, called ‘cleaned refinement reduction’ is the most robust one with regard to significant background noise and even shows a reconstruction ability being similar to the one of a child at the age of 4.
KeywordsBackground Noise Travel Salesman Problem Delaunay Triangulation Reduction Algorithm Voronoi Region
Unable to display preview. Download preview PDF.
- 1.Althaus, E., Mehlhorn, K.: TSP-based curve reconstruction in polynomial time. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 686–695 (2000)Google Scholar
- 3.Amenta, N., Bern, M., Kamvysselis, M.: A new Voronoi-based surface reconstruction algorithm. In: Proceedings of the 25th Annual Conference on Computer Graphics and Interact. Techn., pp. 415–421 (1998)Google Scholar
- 4.Attali, D.: r-Regular shape reconstruction from unorganized points. In: Proceedings of the 13th Annual ACM Symposium on Comput. Geom., pp. 248–253 (1997)Google Scholar
- 6.Bernardini, F., Bajaj, C.: Sampling and reconstructing manifolds using alpha-shapes. In: Proc. 9th Canad. Conf. Comput. Geom. (1997)Google Scholar
- 7.Dey, T., Kumar, P.: A simple provable algorithm for curve reconstruction. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discr. Algorithms, pp. 893–894. Society for Industrial and Applied Mathematics, Philadelphia (1999)Google Scholar
- 8.Dey, T., Mehlhorn, K., Ramos, E.: Curve reconstruction: Connecting dots with good reason. In: Proceedings of the 15th Annual Symposium on Computational Geometry, pp. 197–206. ACM, New York (1999)Google Scholar
- 11.Mukhopadhyay, A., Das, A.: An RNG-based heuristic for curve reconstruction. In: 3rd International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2006, pp. 246–251 (2006)Google Scholar
- 13.Rosenberg, B., Langridge, D.: A computational view of perception. Perception 2(4) (1973)Google Scholar