102291 search results - page 292 / 20459 » Computability in Computational Geometry |
154
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We consider the problem of reconstructing a compact 3manifold (with boundary) embedded in R3 from its crosssections with a given set of cutting planes having arbitrary orientation...
180
click to vote
COMGEO
2010
ACM
15 years 6 months ago
2010
ACM
: We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f Q[x,y,z] of arbitrary total degree N. Additionally, our analy...
197
click to vote
SGP
2007
15 years 9 months ago
2007
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
162
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Fusing partial estimates is a critical and common problem
in many computer vision tasks such as part-based detection
and tracking. It generally becomes complicated and
intractab...
201
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
In vision-based autonomous spacecraft docking multiple views of scene structure captured with the same camera and scene geometry is available under different lighting conditions. ...