109 search results - page 2 / 22 » Computing the betti numbers of arrangements |
RSA
2010
13 years 6 months ago
2010
Polygon spaces like Mℓ = {(u1, · · · , un) ∈ S1 × · · · S1 ; n i=1 liui = 0}/SO(2) or they three dimensional analogues Nℓ play an important rle in geometry and topolo...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. We give a survey of algorithms for computing topological invariants of semi-algebraic sets with special emphasis on the more recent developments in designing algorithms f...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decompos...
ESA
2003
Springer
14 years 28 days ago
2003
Springer
We present an approach that extends the BentleyOttmann sweep-line algorithm [3] to the exact computation of the topology of arrangements induced by non-singular algebraic curves o...