16 search results - page 2 / 4 » Visibility Graphs and Oriented Matroids |
70
Voted
EJC
2006
14 years 9 months ago
2006
We study the positive Bergman complex B+ (M) of an oriented matroid M, which is a certain subcomplex of the Bergman complex B(M) of the underlying unoriented matroid M. The positiv...
64
Voted
DCG
2000
14 years 9 months ago
2000
In this paper we consider the cocircuit graph GM of an oriented matroid M, the 1-skeleton of the cell complex W formed by the span of the cocircuits of M. In general, W is not dete...
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
Visibility estimation is arguably the most difficult problem in dense 3D reconstruction from multiple arbitrary views. In this paper, we propose a simple new approach to estimating...
75
Voted
GD
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Many graph drawing algorithms use st-numberings (st-orientations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a d...