Pankaj K. Agarwal, Jiri Matousek, Otfried Schwarzkopf  Home/Search
Context Related
Links: ACM DBLP | archive.cs.uu.nl/pub/RU...199439.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.uu.nl/resear...EAR=&AUTH=&GRP= (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present randomized algorithms for computing many faces in an arrangement of lines or of segments in the plane, which are considerably simpler and slightly faster than the previously known ones. The main new idea is a simple randomized O(n log n) expected time algorithm for computing n cells in an arrangement of n lines. (Update)
Cited by: More
Data Structures for Maintaining Set Partitions - Bender, Sethia, Skiena (2003) (Correct)
When Crossings Count - Approximating the Minimum Spanning Tree - Har-Peled, Indyk (2002) (Correct)
Online Point Location in Planar Arrangements and Its.. - Har-Peled, Sharir (2002) (Correct)
Similar documents (at the sentence level):
65.7%: Computing Many Faces in Arrangements of Lines and Segments - Agarwal, Matousek.. (1994) (Correct)
Active bibliography (related documents): More All
0.2: Erased Arrangements of Lines and Convex Decompositions of.. - Hershberger, Snoeyink (1997) (Correct)
0.2: The Number of Edges of Many Faces in a Line Segment.. - Aronov, Edelsbrunner, .. (1992) (Correct)
0.2: On the Number of Incidences Between Points and Curves - Pach, Sharir (Correct)
Similar documents based on text: More All
1.0: Constructing Levels in Arrangements and Higher.. - Agarwal, de Berg, .. (1995) (Correct)
0.8: The Overlay of Lower Envelopes and its Applications - Agarwal, Schwarzkopf, Sharir (1996) (Correct)
0.7: On Lazy Randomized Incremental Construction - de Berg, Dobrindt, Schwarzkopf (1995) (Correct)
Related documents from co-citation: More All
15: Applications of random sampling in computational geometry - Clarkson, Shor - 1989
15: Computational Geometry: An Introduction Through Randomized Algorithms (context) - Mulmuley - 1993
14: Davenport-Schinzel Sequences and Their Geometric Applications - Agarwal, Sharir - 1995
BibTeX entry: (Update)
P.K. Agarwal, J. Matousek, and O. Schwarzkopf. Computing many faces in arrangements of lines and segments. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 76--84, 1994. http://citeseer.ist.psu.edu/article/agarwal94computing.html More
@inproceedings{ agarwal94computing,
author = "Pankaj Agarwal and Ji\v{r}{\'\i} Matou\v{s}ek and Otfried Schwarzkopf",
title = "Computing Many Faces in Arrangements of Lines and Segments",
booktitle = "Proceedings of the Tenth Annual Symposium on Computational Geometry",
address = "Stony Brook, New York",
pages = "76--84",
year = "1994",
url = "citeseer.ist.psu.edu/article/agarwal94computing.html" }
Citations (may not include all citations):481 Algorithms in Combinatorial Geometry (context) - Edelsbrunner - 1987 ACM
335 Applications of random sampling in computational geometry II - Clarkson, Shor - 1989
108 Combinatorial complexity bounds for arrangements of curves a.. (context) - Clarkson, Edelsbrunner et al. - 1990 ACM
88 Data Structures and Algorithms 3: Multi-dimensional Searchin.. (context) - Mehlhorn - 1984
75 A deterministic view of random sampling and its use in geome.. (context) - Chazelle, Friedman - 1990 DBLP
69 A fast planar partition algorithm (context) - Mulmuley - 1990
69 A fast planar partition algorithm (context) - Mulmuley - 1991
63 Ray shooting in polygons using geodesic triangulations (context) - Chazelle, Edelsbrunner et al. - 1991 ACM DBLP
58 A pedestrian approach to ray shooting: Shoot a ray (context) - Hershberger, Suri - 1993
22 ffl-nets and simplex range queries (context) - Haussler, Welzl - 1987
18 Computing a face in an arrangement of line segments (context) - Chazelle, Edelsbrunner et al. - 1993 ACM DBLP
15 Combinatorics and algorithms of arrangements (context) - Guibas, Sharir - 1993
14 Discrete and Computational Geometry (context) - Agarwal, of et al. - 1990 ACM
13 On lazy randomized incremental construction - de Berg, Dobrindt et al. - 1994 ACM DBLP
9 A theorem on arrangements of lines in the plane (context) - Canham - 1969
8 The complexity of many faces in arrangements of lines and of.. (context) - Edelsbrunner, Guibas et al. - 1990
8 Extremal problems in discrete geometry (context) - Szemer'edi, Jr - 1983 DBLP
7 the maximal number of edges of many faces in an arrangement (context) - Edelsbrunner, Welzl - 1986
7 Improved bounds on the complexity of many faces in arrangeme.. (context) - Aronov, Edelsbrunner et al. - 1992
6 Computing a single face in an arrangement of segments (context) - Clarkson - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.uu.nl/research/techreps/techreps.php?submit=show+reports&YEAR=&AUTH=&GRP=): More
On the Two-Level Uncapacitated Facility Location Problem - Aardal, Labbé (1995) (Correct)
A Tourist Guide through Treewidth - Bodlaender (1993) (Correct)
Predictive Probabilistic Models for Treatment Planning in.. - Peek (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC