13 search results - page 1 / 3 » Enumerating split-pair arrangements |
COMPGEOM
1991
ACM
13 years 8 months ago
1991
ACM
We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration o...
JCT
2008
13 years 4 months ago
2008
An arrangement of the multi-set {1, 1, 2, 2, . . . , n, n} is said to be "split-pair"
CCCG
2001
13 years 6 months ago
2001
A recent progress on the complete enumeration of oriented matroids enables us to generate all combinatorial types of small point configurations and hyperplane arrangements in gene...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a notion of flip which transforms a pseudoline arrangement with contact...
WADS
2007
Springer
13 years 11 months ago
2007
Springer
We consider the problem of computing the centroid of all the vertices in a non-degenerate arrangement of n lines. The trivial approach requires the enumeration of all `n 2 ´ verti...