Tamal K. Dey
- 1.N. Amenta and M. Bern. Surface reconstruction by Voronoi filtering. Discrete Comput. Geom., 22 (1999), 481-504.Google Scholar
Cross Ref
- 2.N. Amenta, M. Bern and D. Eppstein. The crust and the/~-skeleton: combinatorial curve reconstruction. Graphical Models and Image Processing, 60 (1998), 125-135. Google ScholarDigital Library
- 3.N. Amenta, S. Choi, T. K. Dey and N. Leekha. A simple algorithm for homeomorphic surface reconstruction. To appear in 16th A CM Sympos. Comput. Geom., 2000. Google ScholarDigital Library
- 4.E. Althaus and K. Mehlhorn. Polynomial time TSP-based curve reconstruction. Proc. 11th A CM-SIAM Sympos. Discrete Algorithms, (2000), 686-695. Google ScholarDigital Library
- 5.D. Attali. r-regular shape reconstruction from unorganized points. Proc. 13th A CM Sympos. Comput. Geom., (1997), 248-253. Google ScholarDigital Library
- 6.F. Bernardini and C. L. Bajaj. Sampling and reconstructing manifolds using a-shapes. Proc. 9th Canadian Conf. Comput. Geom., (1997), 193-198.Google Scholar
- 7.T. K. Dey and P. Kumar. A simple provable algorithm for curve reconstruction. Proc. A CM- SIAM Sympos. Discr. Algorithms, (1999), 893- 894. Google ScholarDigital Library
- 8.T. K. Dey, K. Mehlhorn and E. A. Ramos. Curve reconstruction: connecting dots with good reason. Proc. 15th A CM Sympos. Comput. Geom., (1999), 197-206. Google ScholarDigital Library
- 9.H. Edelsbrunner, D. G. Kirkpatrick and R. Seidel. On the shape of a set of points in the plane. IEEE Trans. Information Theory, 29, (1983), 551-559.Google ScholarDigital Library
- 10.L. H. de Figueiredo and J. de Miranda Gomes. Computational morphology of curves. Visual Computer, 11, (1995), 105-112.Google Scholar
- 11.J. Giesen. Curve reconstruction, the TSP, and Menger's theorem on length. Proc. 15th Ann. Sympos. Comput. Geom., (1999), 207-216. Google ScholarDigital Library
- 12.C. Gold and J. Snoeyink. Crust and anti-crust: a one-step boundary and skeleton extraction algorithm. To appear in Algorithmica, 2000. Also Proc. 15th. A CM Sympos. Comput. Geom., (1999), 189-196. Google ScholarDigital Library
- 13.H. Hoppe, T. DeRose, T. Duchamp, J. Mc- Donald and W. Stuetzle. Surface reconstruction from unorganized points. SIGGRAPH 92, (1992), 71-78. Google ScholarDigital Library
- 14.M. Melkemi. A-shapes and their derivatives. 13th ACM Sympos. Comput. Geom. , (1997), 367-369. Google ScholarDigital Library
- 15.J. O'Rourke, H. Booth and R. Washington. Connect-the-dots: A new heuristic. Comput. Vision Graph. Image Process., 39, (1987), 258- 266. Google ScholarDigital Library
Index Terms
- Reconstruction curves with sharp corners
Recommendations
Reconstruction of underlying curves with styling radius corners
This paper presents a new curve fitting framework for styling design data. Given a data set that represents a filleted-like curve, underlying curves (U-curves) and styling radius corners (SR-corners) are generated by fitting to low curvature parts and ...
3D Reconstruction of parametric curves: recovering the control points
This article introduces a new curve reconstruction method based on recovering the control points of parametric cubic curves. The method developed here has two stages: finding the 3D control points of parametric curves and reconstruction of free curves. ...
Single-View 3D Reconstruction of Curves
Advances in Computer GraphicsAbstractThis paper describes a method to generate a 3D curve from a planar polygonal curve. One application of such method is the modeling of trajectories of moving objects in 3D using sketches. Given a planar polygonal curve , our algorithm computes a ...
Comments