Title :
An RNG-based heuristic for curve reconstruction
Author :
Mukhopadhyay, Asish ; Das, Aruneema
Author_Institution :
Sch. of Comput. Sci., Windsor Univ., Windsor, ON
Abstract :
In this paper we propose an RNG-based heuristic for curve reconstruction. Given a set of n sample points S, we first construct a relative neighbourhood graph on S, which is shown to contain all edges joining adjacent points on the unknown curve for an isin-sample with isin < 1/5. Next, we use a heuristic to remove non-adjacent edges. It is extremely simple and works remarkably well for sample points drawn from a large variety of curves.
Keywords :
computational geometry; curve fitting; graph theory; RNG-based heuristic; curve reconstruction; relative neighbourhood graph; Algorithm design and analysis; Computer science; Filtering algorithms; Gold; Reconstruction algorithms; Sampling methods; Shape control; Skeleton; Terminology; Traveling salesman problems;
Conference_Titel :
Voronoi Diagrams in Science and Engineering, 2006. ISVD '06. 3rd International Symposium on
Conference_Location :
Banff, Alberta, BC
Print_ISBN :
0-7695-2630-6
DOI :
10.1109/ISVD.2006.8
