Abstract
We present an algorithm to "reconstruct" a smooth k-dimensional manifold M embedded in an Euclidean space ℝd from a "sufficiently dense" point sample from the manifold. The algorithm outputs a simplicial manifold that is homeomorphic and geometrically close to M. The running time is O(n log n) where n is the number of points in the sample (the multiplicative constant depends exponentially on the dimension though).
| Original language | English |
|---|---|
| Pages | 1018-1027 |
| Number of pages | 10 |
| Publication status | Published - 2005 |
| Event | Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms - Vancouver, BC, United States Duration: 23 Jan 2005 → 25 Jan 2005 |
Conference
| Conference | Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|---|
| Country/Territory | United States |
| City | Vancouver, BC |
| Period | 23/01/05 → 25/01/05 |