43 search results - page 3 / 9 » Combinatorial complexity in O-minimal geometry |
CCCG
2006
13 years 9 months ago
2006
We present a new normal form for bounded-curvature paths that admits a combinatorial discription of such paths and a bound on the algebraic complexity of the underlying geometry.
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
COCOA
2010
Springer
13 years 2 months ago
2010
Springer
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model...
JCT
2006
13 years 7 months ago
2006
We study the Bergman complex B(M) of a matroid M: a polyhedral complex which arises in algebraic geometry, but which we describe purely combinatorially. We prove that a natural su...
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...