732 search results - page 4 / 147 » Testing Geometric Convexity |
ECCV
2010
Springer
13 years 10 months ago
2010
Springer
Globally optimal formulations of geometric computer vision problems comprise an exciting topic in multiple view geometry. These approaches are unaffected by the quality of a provid...
DCG
2007
13 years 7 months ago
2007
Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...
DAGSTUHL
2003
13 years 9 months ago
2003
In this paper we discuss reliable methods in the field of finite precision geometry. We begin with a brief survey of geometric computing and approaches generally used in dealing ...
GD
2009
Springer
13 years 11 months ago
2009
Springer
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
FLAIRS
2004
13 years 9 months ago
2004
A blind classification algorithm is presented that uses hyperdimensional geometric algorithms to locate a hypothesis, in the form of a convex polytope or hyper-sphere. The convex ...