Numerical continuation methods: an introduction
Numerical continuation methods: an introduction
Generalized barycentric coordinates on irregular polygons
Journal of Graphics Tools
Polygon Evolution by Vertex Deletion
SCALE-SPACE '99 Proceedings of the Second International Conference on Scale-Space Theories in Computer Vision
Skeleton Pruning by Contour Partitioning with Discrete Curve Evolution
IEEE Transactions on Pattern Analysis and Machine Intelligence
Provably good 2D shape reconstruction from unorganized cross-sections
SGP '08 Proceedings of the Symposium on Geometry Processing
| Hi-index | 0.00 |
One of the challenging problems in computer vision is object reconstruction from cross sections. In this paper, we address the problem of 2D object reconstruction from arbitrary linear cross sections. This problem has not been much discussed in the literature, but holds great importance since it lifts the requirement of order within the cross sections in a reconstruction problem, consequently making the reconstruction problem harder. Our approach to the reconstruction is via continuous deformations of line intersections in the plane. We define Voronoi diagram based barycentric coordinates on the edges of n-sided convex polygons as the area stolen by any point inside a polygon from the Voronoi regions of each open oriented line segment bounding the polygon. These allow us to formulate homotopies on edges of the polygons from which the underlying object can be reconstructed. We provide results of the reconstruction including the necessary derivation of the gradient at polygon edges and the optimal placement of cutting lines. Accuracy of the suggested reconstruction is evaluated by means of various metrics and compared with one of the existing methods.