Browse > Article
http://dx.doi.org/10.6109/jkiice.2010.14.9.2016

Reconstructing Curves With Self-intersections  

Kim, Hyoung-Seok B. (동의대학교 멀티미디어공학과)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.14, no.9, 2010 , pp. 2016-2022 More about this Journal
Abstract
We propose a new algorithm for reconstructing curves with self-intersections from sample points. In general, the result of curve reconstruction depends on how to select and order the representative points to resemble the shape of sample points. Most of the previous point ordering approaches utilize the Euclidean distance to compute the proximity of sample points without directional information, so they can not solve the non-simple curve reconstruction problem. In this paper, we develop a new distance estimating the adjacency between sample points, which is derived from the standard normal distribution of Brownian motion. Experimental results show that this approach is very effective to non-simple curve reconstruction.
Keywords
Curve reconstruction; Self-intersection;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Thanh An Nguyen and Yong Zeng. VICUR: A human-vision-based algorithm for curve reconstruction. Robotics and Computer Integrated Manufacturing, 24: 824-834, 2008   DOI   ScienceOn
2 Oksendal, B. Stochastic differential equations: An introduction with applications. Springer Verlag, 1998.
3 Philsu Kim and Hyoungseok B. Kim, "Point ordering with the natural distance based on brownian motion", Mathematical problems in engineering, Vol. 2010, Article ID 450460, 17 pages, 2010
4 Dedieu, J.P. and Favardin, C.H., "Algorithms for ordering unorganized points along parametrized curves", Numerical Algorithms, 6 : 160-200, 1994.
5 Taubin, G. and Ronfard, R., "Implicit simplicial models for adaptive curve reconstruction", IEEE Trans. on Pattern Analysis and Machine Intelligence, 18: 321-325, 1996.   DOI   ScienceOn
6 Lee, I.K., "Curve Reconstruction from Unorganized Points", Computer Aided Geometric Design, 17 (2) : 161-177, 2000.   DOI   ScienceOn
7 Dey, T.K. and Kumar, T.K., "A simple provable algorithm for curve reconstruction", Proc. 10th. ACM-SIAM Symp. Discr. Algorithms, 893-894, 1999.
8 Edelsbrunner, H. and Kirkpatrick, D.G. and Seidel, R, "On the shape of a set of points in the plane", IEEE Trans. Information Theory, 551-559, 1983.   DOI
9 Attali, D, "r-regular shape reconstruction from unorganized points", Proc. of 13th Ann. Sympos. Comput. Geom., 248-253, 1997.
10 Amenta, N. and Bern, M. and Eppstein, D., "The crust and the beta-skeleton: combinatorial curve reconstruction", Graphical Models, 60: 125-135, 1998.   DOI   ScienceOn
11 Fang, L. and Gossard, D.C., "Fitting 3D curves to unorganized data points using deformable curves", Proc. of CG International 92, 535-543, 1992.
12 Hoppe, H. and DeRose, T. and Duchamp, T. and McDonald, J. and Stuetzle, W, "Surface Reconstruction from unorganized points", SIGGRAPH 92, 71-78, 1992.
13 Boissonnat, J.D. and Geiger, B, "Three dimentional reconstruction of complex shapes based on the Delaunay triangulation", Proc. of Biomedical Image Process. Biomed. Visualization, 964-975, 1993.
14 Boissonnat, J.D. and Cazals, F, "Smooth surface reconstruction via natural neighbour interpolation of distance functions", Comp. Geom.- Theor. Appl., 22: 185-203, 2002.   DOI   ScienceOn