r-regular shape reconstruction from unorganized points
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
The crust and the &Bgr;-Skeleton: combinatorial curve reconstruction
Graphical Models and Image Processing
Curve reconstruction: connecting dots with good reason
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
A simple provable algorithm for curve reconstruction
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The watershed transform: definitions, algorithms and parallelization strategies
Fundamenta Informaticae - Special issue on mathematical morphology
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
An RNG-based heuristic for curve reconstruction
ISVD '06 Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering
Topologically correct image segmentation using alpha shapes
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
| Hi-index | 0.00 |
There exist a lot of algorithms for 2D contour reconstruction from sampling points which guarantee a correct result if certain sampling criteria are fulfilled. Nevertheless nearly none of these algorithms can deal with non-manifold boundaries of multiple regions. We discuss, which problems occur in this case and present a boundary reconstruction algorithm, which can deal with partitions of multiple regions, and non-smooth boundaries (e.g. corners or edges). In comparison to well-known contour reconstruction algorithms, our method requires a lower sampling density and the sampling points can be noisy.