A Survey and Comparative Study for Connecting 2D points
-
Published:2020-03-01
Issue:
Volume:
Page:10-18
-
ISSN:2394-4099
-
Container-title:International Journal of Scientific Research in Science, Engineering and Technology
-
language:en
-
Short-container-title:IJSRSET
Author:
K Jijith1, Joseph Philumon2
Affiliation:
1. M. Tech Scholar, Department of Computer Science and Engineering, Government Engineering College, Idukki, Kerala, India 2. Assistant Professor, , Department of Computer Science and Engineering, Government Engineering College, Idukki, Kerala, India
Abstract
Reconstruction from noisy point sets has many ap-plications in the areas of science and engineering. Research effort in reconstructing shape from noisy point sets. Reconstruction on planar point including shape, surface, curve and manifold recon-struction. Good algorithms are required to create a good shape from a given point set. Better local and global sampling conditions form the base of these algorithms. Reconstruction from noisy point set is not extensively studied and therefore the researchers do not have a successful algorithm. Reconstruction from the stage is begun before many decades and these activities are now being extended for a few days. Extending any older reconstruction algorithms needs a good understanding and comparison of all previous algorithms. This survey is spamming on different reconstruction algorithms, various local sampling conditions, extension of different works and their working conditions and reconstruction implementation from point sets. Survey begins after 1997 and compares various extension works. The sampling condition for all these algorithms contributes significantly to the construction of algorithms, thus different local sampling conditions are investigated. During this study, all algorithms for reconstruction are tabulated and different parameters for these algorithms are compared. This survey is concluding with several promising directions for the future works on reconstruction.
Publisher
Technoscience Academy
Reference33 articles.
1. Herbert Edelsbrunner, David G . Kirkpatrick,And Raimund Seidel, “On the shape of a set of points in the plane,” in IEEE ,2000, 2. Luiz Henrique de FigueiredoJonas de Miranda Gomes, Computational morphology of curves.The Visual Computer , February 1994, Volume 11, Issue 2, pp 105–112 3. David G.Kirkpatrick, John D.Radke, “A Framework for Computational Morphology,” Elsevier Machine Intelligence and Pattern Recognition, Volume 2, 1985, Pages 217-248 4. RemcoC.Veltkamp,3DComputationalMorphologyr,CWI,Dept.Interactive Systems ATTALI D, “r -regular shape reconstruction from unorga- nized points.,” In Symp. Comp. Geom.., (1997), pp. 248–253. 2 5. A MENTA N., B ERN M. W., E PPSTEIN D, “The crust and the beta-skeleton: Combinatorial curve reconstruction.,”Graphical Models and Image Processing. 60, 2 (1998), 125–135. 2, 3, 13, 14, 15, 16
|
|