16 search results - page 2 / 4 » Visibility Graphs and Oriented Matroids |
EJC
2006
13 years 5 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...
DCG
2000
13 years 5 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
13 years 11 months ago
2006
IEEE
ECCV
2006
Springer
14 years 7 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...
GD
2005
Springer
13 years 11 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...