Arrangements  (Make Corrections)  
Dan Halperin
Handbook of Discrete and Computational Geometry, CRC Press, 1997

  Home/Search   Context   Related
 
View or download:
math.tau.ac.il/pub/danha/arrg.ps.gz
math.tau.ac.il/~halperin/p...arrg.ps.gz
Cached:  PS.gz  PS  PDF  DjVu  Image  Update  Help

From:  math.tau.ac.il/~sariel/CG (more)
From:  math.tau.ac.il/~ha...publications
Homepages:  D.Halperin  HPSearch  (Update Links)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: INTRODUCTION Given a finite collection S of geometric objects such as hyperplanes or spheres in R d , the arrangement A(S) is the decomposition of R d into connected open cells of dimensions 0; 1; : : :; d induced by S. Besides being interesting in their own right, arrangements of hyperplanes have served as a unifying structure for many problems in discrete and computational geometry. With the recent advances in the study of arrangements of curved (algebraic) surfaces, arrangements have... (Update)

Active bibliography (related documents):   More   All
1.5:   Arrangements in Higher Dimensions: Voronoi Diagrams, Motion.. - Sharir (1995)   (Correct)
1.1:   Arrangements and their Applications in Robotics: Recent.. - Halperin, Sharir (1995)   (Correct)
0.6:   Almost Tight Upper Bounds for the Single Cell and Zone.. - Halperin, Sharir (1995)   (Correct)

Users who viewed this document also viewed:   More   All
0.0:   Improved algorithms for constructing fault-tolerant spanners - Levcopoulos, Narasimhan.. (2000)   (Correct)
0.0:   Scene Complexity for Rendering in Flatland - Milo Hyben Ilja (1998)   (Correct)
0.0:   On the Complexity of Some Geometric Intersection Problems - Dévai (1995)   (Correct)

Similar documents based on text:   More   All
0.4:   Properties of Arrangement Graphs - Bose, Everett, Wismath   (Correct)
0.2:   Sparse Arrangements and the Number of Views of Polyhedral Scenes - de Berg, al. (1992)   (Correct)
0.0:   Fuzzy Substructure Discovery - Holder, Cook, Bunke (1992)   (Correct)

BibTeX entry:   (Update)

@incollection{ halperin97arrangements,
    author = "Halperin",
    title = "Arrangements",
    booktitle = "Handbook of Discrete and Computational Geometry, {CRC} Press, 1997",
    editor = "Jacob E. Goodman and Joseph O'Rourke",
    year = "1997",
    url = "citeseer.nj.nec.com/97106.html" }
Citations (may not include all citations):
1084   Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985    
413   Algorithms in Combinatorial Geometry (context) - Edelsbrunner - 1987
267   Applications of random sampling in computational geometry - Clarkson, Shor - 1989
216   Primitives for the manipulation of general subdivisions and .. (context) - Guibas, Stolfi - 1985
172   Cambridge University Press (context) - O'Rourke, in - 1994
153   Computational Geometry: An Introduction Through Randomized A.. (context) - Mulmuley - 1994
141   Davenport-Schinzel Sequences and Their Geometric Application.. - Sharir, Agarwal - 1995
95   Convex Polytopes (context) - Grunbaum - 1967
77   Combinatorial Geometry (context) - Pach, Agarwal - 1995
76   Combinatorial complexity bounds for arrangements of curves a.. (context) - Clarkson, Edelsbrunner et al. - 1990
62   On range searching with semialgebraic sets - Agarwal, Matousek - 1994
54   Filtering search: a new approach to query-answering (context) - Chazelle - 1986
53   A randomized algorithm for closest-point queries (context) - Clarkson - 1988
45   Almost tight upper bounds for lower envelopes in higher dime.. (context) - Sharir - 1994
43   Finding the upper envelope of n line segments in O (context) - Hershberger - 1989
41   Output-sensitive results on convex hulls (context) - Chan - 1995
39   sets in arrangements of curves and surfaces (context) - Sharir - 1991
38   On lazy randomized incremental construction - de Berg, Dobrindt et al. - 1995
33   Constructing belts in two-dimensional arrangements with appl.. (context) - Edelsbrunner, Welzl - 1986
33   the general motion planning problem with two degrees of free.. (context) - Guibas, Sharir et al. - 1989
33   Primitives for the manipulation of three-dimensional subdivi.. (context) - Dobkin, Laszlo - 1989
31   Facing up to Arrangements: Face-Count Formulas for Partition.. (context) - Zaslavsky - 1975
27   An upper bound on the number of planar k-sets (context) - Pach, Steiger et al. - 1992
26   Representing geometric structures in d dimensions: Topology .. (context) - Brisson - 1993
25   Arrangements of curves in the plane: Topology (context) - Edelsbrunner, Guibas et al. - 1992
25   Computing envelopes in four dimensions with applications - Agarwal, Aronov et al. - 1994
24   the zone theorem for hyperplane arrangements (context) - Edelsbrunner, Seidel et al. - 1993
23   The nature and meaning of perturbations in geometric computi.. (context) - Seidel - 1994
22   Vertical decompositions for triangles in 3-space - de Berg, Guibas et al. - 1996
22   Aspect graphs: An introduction and survey of recent results (context) - Bowyer, Dyer - 1990
22   Constructing levels in arrangements and higher order Voronoi.. - Agarwal, de Berg et al. - 1994
22   Castles in the air revisited (context) - Aronov, Sharir - 1994
21   Vertical decomposition of shallow levels in 3-dimensional ar.. - Agarwal, Efrat et al. - 1995
20   in and M.H. Overmars. Spheres, molecules, and hidden surface.. (context) - Halper - 1994
20   New bounds for lower envelopes in three dimensions (context) - Halperin, Sharir - 1994
19   Computing many faces in arrangements of lines and segments - Agarwal, Matousek et al. - 1994
17   with applications to separation and transversal problems (context) - Everett, Robert et al. - 1993
17   the zone of a surface in a hyperplane arrangement (context) - Aronov, Pellegrini et al. - 1993
16   Computing roadmaps in general semialgebraic sets - Canny - 1993
16   the sum of squares of cell complexities in hyperplane arrang.. - Aronov, Matousek et al. - 1994
15   Algorithmic Motion Planning via Arrangements of Curves and o.. (context) - Halperin - 1992
14   Geometric manipulation of flexible ligands - Finn, Halperin et al. - 1996
14   Triangles in space or building (context) - Aronov, Sharir - 1990
13   Arrangements and their applications in robotics: Recent deve.. - Halperin, Sharir - 1995
12   The number of small semispaces of a finite set of points in .. (context) - Alon, Gyori - 1986
12   the number of line separations of a finite set in the plane (context) - Edelsbrunner, Welzl - 1985
12   The maximal number of faces of a convex polytope (context) - McMullen - 1970
12   Crossing numbers and hard Erdos problems in discrete geometr.. (context) - Sz'ekely
10   The overlay of lower envelopes in three dimensions and its a.. (context) - Agarwal, Schwarzkopf et al. - 1995
10   The complexity of many cells in arrangements of planes and r.. (context) - Edelsbrunner, Guibas et al. - 1990
8   A new technique for analyzing substructures in arrangements - Tagansky - 1995
8   Sparse arrangements and the number of views of polyhedral sc.. (context) - de Berg, Halperin et al.
8   Almost tight upper bounds for the single cell and zone probl.. - Halperin, Sharir - 1995
7   Counting facets and incidences (context) - Agarwal, Aronov - 1992
6   the complexity of a single cell in certain arrangements of s.. - Halperin - 1994
6   Motion planning in stereotaxic radiosurgery - Schweikard, Adler et al. - 1993
6   Arrangements and Spreads (context) - Grunbaum - 1972
5   The upper envelope of piecewise linear functions: Tight comp.. (context) - Edelsbrunner - 1989
3   On vertical decomposition of arrangements of hyperplanes in .. - Guibas, Halperin et al. - 1995
3   Arrangements of hyperplanes (context) - Grunbaum - 1971
2   Vertical decomposition of a single cell in a threedimensiona.. - Schwarzkopf, Sharir - 1996
2   volume 46 of Encyclopedia of Mathematics (context) - Bjorner, Vergnas et al. - 1993
2   line construction of the upper envelope of triangles and sur.. (context) - Boissonnat, Dobrindt - 1996
2   Arrangements of polytopes (context) - Aronov, Bern et al. - 1991
1   A simple and efficient procedure for assembly partitioning u.. (context) - Guibas, Halperin et al. - 1995
1   Computing roadmaps of semi-algebraic sets (context) - Basu, Pollack et al. - 1996

Documents on the same site (http://www.math.tau.ac.il/~sariel/CG.html):   More
Robotics - Halperin, Kavraki, Latombe   (Correct)
Making Geometry Visible: An introduction to the Animation of.. - Hausner, Dobkin (1997)   (Correct)
Topological Methods in Combinatorics and Geometry - Lecture Notes   (Correct)

Online articles have much greater impact   More about CiteSeer   Add search form to your site   Submit documents   Feedback  

CiteSeer - citeseer.org - Terms of Service - Privacy Policy - Copyright © 1997-2002 NEC Research Institute