Abstract
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.
Original language | English |
---|---|
Title of host publication | Transactions on Computational Science XIV : Special Issue on Voronoi Diagrams and Delaunay Triangulation |
Editors | M. L. Gavrilova |
Publisher | Springer |
Publication date | 2011 |
Pages | 188-210 |
ISBN (Print) | 978-3-642-25248-8 |
ISBN (Electronic) | 978-3-642-25249-5 |
DOIs | |
Publication status | Published - 2011 |
Event | 7th International Symposium on Voronoi Diagrams in Science and Engineering - Quebec city, Canada Duration: 28 Jun 2010 → 30 Jun 2010 Conference number: 7 http://isvd2010.scg.ulaval.ca/ |
Conference
Conference | 7th International Symposium on Voronoi Diagrams in Science and Engineering |
---|---|
Number | 7 |
Country/Territory | Canada |
City | Quebec city |
Period | 28/06/2010 → 30/06/2010 |
Internet address |
Series | Lecture Notes in Computer Science |
---|---|
Number | 6970 |
ISSN | 0302-9743 |