5 search results - page 1 / 1 » Matroids on convex geometries (cg-matroids) |
COSIT
2003
Springer
13 years 10 months ago
2003
Springer
This paper looks at axioms for convexity, and shows how they can be applied to discrete spaces. Two structures for a discrete geometry are considered: oriented matroids, and cell c...
DM
2007
13 years 5 months ago
2007
We consider matroidal structures on convex geometries, which we call cg-matroids. The concept of a cg-matroid is closely related to but different from that of a supermatroid intro...
STOC
1995
ACM
13 years 9 months ago
1995
ACM
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...
COMPGEOM
2004
ACM
13 years 11 months ago
2004
ACM
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
COMPGEOM
2003
ACM
13 years 11 months ago
2003
ACM
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...