Partitioning Arrangements of Lines, I: An Efficient Deterministic Algorithm.
Agarwal, P.K.
Discrete & computational geometry, Tome 5 (1990), p. 449-484 / Harvested from Göttinger Digitalisierungszentrum
Access to full text
Publié le : 1990-01-01
EUDML-ID : urn:eudml:doc:131132 
@article{GDZPPN000364541,
     title = {Partitioning Arrangements of Lines, I: An Efficient Deterministic Algorithm.},
     journal = {Discrete \& computational geometry},
     volume = {5},
     year = {1990},
     pages = {449-484},
     zbl = {0701.68035},
     url = {http://dml.mathdoc.fr/item/GDZPPN000364541}
}

Agarwal, P.K. Partitioning Arrangements of Lines, I: An Efficient Deterministic Algorithm.. Discrete & computational geometry, Tome 5 (1990) pp. 449-484. http://gdmltest.u-ga.fr/item/GDZPPN000364541/