50 search results - page 5 / 10 » Computational Experience with an Interior Point Cutting Plan... |
CVPR
2012
IEEE
11 years 9 months ago
2012
IEEE
We propose an energy-based framework for approximating surfaces from a cloud of point measurements corrupted by noise and outliers. Our energy assigns a tangent plane to each (noi...
ICCV
2003
IEEE
13 years 12 months ago
2003
IEEE
A new calibration algorithm for multi-camera systems using a planar reference pattern is proposed. The algorithm is an extension of Sturm-Maybank-Zhang style plane-based calibrati...
DCG
2011
13 years 1 months ago
2011
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
SGP
2007
13 years 9 months ago
2007
In this paper, we consider the problem of reconstructing a shape from unorganized cross-sections. The main motivation for this problem comes from medical imaging applications wher...
MOR
2010
13 years 5 months ago
2010
The goal of the current paper is to introduce the notion of certificates which verify the accuracy of solutions of computational problems with convex structure; such problems inc...