A simple provable algorithm for curve reconstruction
作者： Tamal K. Dey , Piyush Kumar
DOI:
关键词: Algorithm 、 Scheduling (computing) 、 Mathematics 、 Approximation algorithm 、 Sampling density 、 Polynomial-time approximation scheme 、 Simple (abstract algebra) 、 Curve reconstruction 、 Minimax approximation algorithm
摘要: We present an algorithm that provably reconstructs a curve in the framework introduced by Amenta, Bern and Eppstein. The highlights of are: (i) it is simple, (ii) requires sampling density better than previously known, (iii) can be adapted for reconstruction higher dimensions straightforwardly.
参考文章(6)
Herbert Edelsbrunner, Shape Reconstruction with Delaunay Complex latin american symposium on theoretical informatics. pp. 119- 132 ,(1998) , 10.1007/BFB0054315
Mahmoud Melkemi, A-shapes of a finite point set symposium on computational geometry. pp. 367- 369 ,(1997) , 10.1145/262839.263005
Dominique Attali, r-regular shape reconstruction from unorganized points symposium on computational geometry. pp. 248- 253 ,(1997) , 10.1145/262839.262980
Nina Amenta, Marshall Bern, David Eppstein, The crust and the B-Skeleton: combinatorial curve reconstruction Graphical Models and Image Processing. ,vol. 60, pp. 125- 135 ,(1998) , 10.1006/GMIP.1998.0465
Jonathan W. Brandt, V.Ralph Algazi, Continuous skeleton computation by Voronoi diagram Cvgip: Image Understanding. ,vol. 55, pp. 329- 338 ,(1991) , 10.1016/1049-9660(92)90030-7
H. Edelsbrunner, D. Kirkpatrick, R. Seidel, On the shape of a set of points in the plane IEEE Transactions on Information Theory. ,vol. 29, pp. 551- 559 ,(1983) , 10.1109/TIT.1983.1056714