Name
Abstract | ||
|---|---|---|
We present an algorithm to reconstruct a collection of piecewise smooth simple closed curves in the plane from a set of n sample points in O(n log n) time We prove our algorithm correctly reconstructs the curves assuming certain sampling conditions which are based on the minimum angle made by tangents at any corner point but does not include any assumptions about the uniformity of the sampling. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1142/S0218195902000931 | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS |
Keywords | DocType | Volume |
curve reconstruction, Voronoi diagrams, Delaunay triangulations, algorithms | Journal | 12 |
Issue | ISSN | Citations |
5 | 0218-1959 | 17 |
PageRank | References | Authors |
0.75 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tamal K. Dey | 1 | 2349 | 169.82 |
| Rephael Wenger | 2 | 441 | 43.54 |