Partitioning Arrangements of Lines, I: An Efficient Deterministic Algorithm.

P.K. Agarwal

Discrete & computational geometry (1990)

  • Volume: 5, Issue: 5, page 449-484
  • ISSN: 0179-5376; 1432-0444/e

How to cite

top

Agarwal, P.K.. "Partitioning Arrangements of Lines, I: An Efficient Deterministic Algorithm.." Discrete & computational geometry 5.5 (1990): 449-484. <http://eudml.org/doc/131132>.

@article{Agarwal1990,
author = {Agarwal, P.K.},
journal = {Discrete & computational geometry},
keywords = {partitioning algorithm},
number = {5},
pages = {449-484},
title = {Partitioning Arrangements of Lines, I: An Efficient Deterministic Algorithm.},
url = {http://eudml.org/doc/131132},
volume = {5},
year = {1990},
}

TY - JOUR
AU - Agarwal, P.K.
TI - Partitioning Arrangements of Lines, I: An Efficient Deterministic Algorithm.
JO - Discrete & computational geometry
PY - 1990
VL - 5
IS - 5
SP - 449
EP - 484
KW - partitioning algorithm
UR - http://eudml.org/doc/131132
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.