On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences

On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences (2003)

Cached

Download Links

[www.cs.uwaterloo.ca]
[www.cs.uwaterloo.ca]

Other Repositories/Bibliography

DBLP

by Timothy M. Chan

Venue:	In Proc. 44th IEEE Sympos. Found. Comput. Sci
Citations:	9 - 2 self

BibTeX

@INPROCEEDINGS{Chan03onlevels,
    author = {Timothy M. Chan},
    title = {On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences},
    booktitle = {In Proc. 44th IEEE Sympos. Found. Comput. Sci},
    year = {2003},
    pages = {544--550}
}

Bookmark

OpenURL

Abstract

We give a surprisingly short proof that in any planar arrangement of n curves where each pair intersects at most a fixed number (s) of times, the k-level has subquadratic (O(n 2s )) complexity. This answers one of the main open problems from the author's previous paper (FOCS'00), which provided a weaker bound for a restricted class of curves (graphs of degree-s polynomials) only. When combined with existing tools (cutting curves, sampling, etc.), the new idea generates a slew of improved k-level results for most of the curve families studied earlier, including a near-O(n ) bound for parabolas.

Citations

643	Algorithms in combinatorial geometry - Edelsbrunner - 1987
371	Davenport-Schinzel sequences and their geometric applications - Agarwal, Sharir - 1998
357	Applications of random sampling in computational geometry - Shor - 1989
121	Lectures on discrete geometry - Matoušek - 2002
106	Lectures on Discrete Geometry - MATOUˇSEK - 2002
89	Improved bounds for planar k-sets and related problems - Dey - 1998
72	Arrangements and their Applications - Agarwal, Sharir - 1998
57	On k-sets in arrangements of curves and surfaces - Sharir - 1991
45	On the number of halving lines - Lovász - 1971
43	Low-dimensional linear programming with violations - Chan
40	On levels in arrangements of lines, segments, planes, and triangles - Agarwal, Aronov, et al. - 1998
38	Point sets with many k-sets - Tóth
36	The number of small semispaces of a finite set of points in the plane - Alon, Győri - 1986
35	Dissection graphs of planar point sets - Erdős, Lovász, et al. - 1973
34	Algorithms for ham-sandwich cuts - Lo, Matousek, et al. - 1994
32	Halfspace range search: an algorithmic application of k-sets - Chazelle, Preparata - 1985
25	An improved bound for k-sets in three dimensions - Sharir, Smorodinsky, et al.
24	Parametric and kinetic minimum spanning trees - Agarwal, Eppstein, et al. - 1998
24	2D arrangements - Wein, Fogel, et al. - 2008
24	An upper bound on the number of planar k-sets - Pach, Steiger, et al. - 1992
23	A new technique for analyzing substructures in arrangements - Tagansky - 1995
21	More on k-sets of finite sets in the plane - Welzl - 1986
20	On levels in arrangements of curves - Chan - 2003
19	Lenses in arrangements of pseudocircles and their applications - Agarwal, Nevo, et al.
17	A characterization of planar graphs by pseudo-line arrangements - Tamaki, Tokuyama - 1997
15	Geometric lower bounds for parametric matroid optimization - Eppstein
15	On the number of k-subsets of a set of n points in the plane - Goodman, Pollack - 1984
12	Remarks on k-level algorithms in the plane - Chan
11	How to cut pseudoparabolas into segments - Tamaki, Tokuyama - 1995
9	Intersection reverse sequences and geometric applications - Marcus, Tardos
8	k-sets and j-facets: a tour of discrete geometry - Andrzejak, Welzl - 1997
8	On k-Sets and their Generalizations - Andrzejak - 2000
6	Radoi˘cić R.: Topological graphs with no self-intersecting cycle of length - Pinchasi
6	More on k-sets of finite sets in the plane, Discrete Comput - Welzl - 1986
4	Parametric Polymatroid Optimization and Its Geometric Applications - Katoh, Tamaki, et al. - 1999
3	On the complexity of many faces in arrangements of circles - Agarwal, Aronov, et al. - 2003
3	On levels in arrangements of surfaces in three dimensions - Chan - 2005
1	On the complexity of many faces in arrangements of circles. To appear in Discrete and Computational Geometry: The Goodman-Pollack Festschrift - Agarwal, Aronov, et al. - 2001
1	On levels in arrangements of curves. Discrete Comput - Chan - 2000