Sciweavers

732 search results - page 17 / 147
» Testing Geometric Convexity
Sort
View
ICCV
2009
IEEE
15 years 20 days ago
Subspace matching: Unique solutions to point matching with geometric constraints
Finding correspondences between feature points is one of the most relevant problems in the whole set of visual tasks. In this paper we address the problem of matching a feature ...
Manuel Marques, Marko Stosic and Joao Costeira
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
13 years 11 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
VLDB
1987
ACM
106views Database» more  VLDB 1987»
13 years 11 months ago
A Dual Space Representation for Geometric Data
Thie paper presents a representation echeme for polyhedral objects in arbitrary dimensions. Each object ie represented as the algebraic sum of convex polyhedra (cells). Each cell ...
Oliver Günther, Eugene Wong
IPCO
2004
114views Optimization» more  IPCO 2004»
13 years 9 months ago
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
IJCV
2007
179views more  IJCV 2007»
13 years 7 months ago
Global Detection of Salient Convex Boundaries
As an important geometric property of many structures or structural components, convexity plays an important role in computer vision and image understanding. In this paper, we desc...
Song Wang, Joachim S. Stahl, Adam Bailey, Michael ...