109 search results - page 7 / 22 » Computing the betti numbers of arrangements |
SWAT
1998
Springer
13 years 12 months ago
1998
Springer
Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. Let U den...
QSHINE
2009
IEEE
14 years 2 months ago
2009
IEEE
Exploiting features of high density wireless sensor networks represents a challenging issue. In this work, the training of a sensor network which consists of anonymous and asynchro...
ICALT
2009
IEEE
14 years 2 months ago
2009
IEEE
A crucial challenge for improving EMLs is to provide an intuitive notation to support educational practitioners to not only understand, but also describe a large number of flexibl...
CCCG
2010
13 years 5 months ago
2010
Various notions of coverage provided by wireless sensor networks have attracted considerable attention over the past few years. In general, coverage can be expressed geometrically...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We show how to compute the planar arrangement induced by segments of arbitrary algebraic curves with the Bentley-Ottmann sweep-line algorithm. The necessary geometric primitives r...