Find out how to access previewonly content
Discrete & Computational Geometry
, Volume 5, Issue 5, pp 449483
First online:
Partitioning arrangements of lines I: An efficient deterministic algorithm
 Pankaj K. AgarwalAffiliated withCourant Institute of Mathematical Sciences, New York University
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
In this paper we consider the following problem: Given a set ℒ ofn lines in the plane, partition the plane intoO(r ^{2}) triangles so that no triangle meets more thanO(n/r) lines of ℒ. We present a deterministic algorithm for this problem withO(nr logn/r) running time, whereω is a constant <3.33.
 Title
 Partitioning arrangements of lines I: An efficient deterministic algorithm
 Journal

Discrete & Computational Geometry
Volume 5, Issue 5 , pp 449483
 Cover Date
 199010
 DOI
 10.1007/BF02187805
 Print ISSN
 01795376
 Online ISSN
 14320444
 Publisher
 Springer New York
 Additional Links
 Topics
 Industry Sectors
 Authors

 Pankaj K. Agarwal ^{(1)}
 Author Affiliations

 1. Courant Institute of Mathematical Sciences, New York University, 10012, NY, USA