109 search results - page 4 / 22 » Computing the betti numbers of arrangements |
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
109
click to vote
IWPEC
2004
Springer
15 years 3 months ago
2004
Springer
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
WEA
2009
Springer
15 years 4 months ago
2009
Springer
We present a cgal-based univariate algebraic kernel, which provides certi ed real-root isolation of univariate polynomials with integer coe cients and standard functionalities such...
DGCI
2005
Springer
15 years 3 months ago
2005
Springer
Topological invariants are extremely useful in many applications related to digital imaging and geometric modeling, and homology is a classical one, which has not yet been fully e...
COMPGEOM
2008
ACM
14 years 11 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...