@article{4079,
author = {Herbert Edelsbrunner and Skiena, Steven Sol},
journal = {American Mathematical Monthly},
number = {7},
pages = {614 -- 618},
publisher = {Mathematical Association of America},
title = {{On the number of furthest neighbor pairs in a point set}},
volume = {96},
year = {1989},
}
@article{4080,
abstract = {This paper proves that any set of n points in the plane contains two points such that any circle through those two points encloses at least n12−112+O(1)n47 points of the set. The main ingredients used in the proof of this result are edge counting formulas for k-order Voronoi diagrams and a lower bound on the minimum number of semispaces of size at most k.},
author = {Herbert Edelsbrunner and Hasan, Nany and Seidel, Raimund and Shen, Xiao-Jun},
journal = {Geometriae Dedicata},
number = {1},
pages = {1 -- 12},
publisher = {Kluwer},
title = {{Circles through two points that always enclose many points}},
doi = {10.1007/BF00181432},
volume = {32},
year = {1989},
}
@article{4081,
abstract = {This paper studies applications of envelopes of piecewise linear functions to problems in computational geometry. Among these applications we find problems involving hidden line/surface elimination, motion planning, transversals of polytopes, and a new type of Voronoi diagram for clusters of points. All results are either combinatorial or computational in nature. They are based on the combinatorial analysis in two companion papers [PS] and [E2] and a divide-and-conquer algorithm for computing envelopes described in this paper.},
author = {Herbert Edelsbrunner and Guibas, Leonidas J and Sharir, Micha},
journal = {Discrete & Computational Geometry},
number = {1},
pages = {311 -- 336},
publisher = {Springer},
title = {{The upper envelope of piecewise linear functions: Algorithms and applications}},
doi = {10.1007/BF02187733},
volume = {4},
year = {1989},
}
@article{4082,
abstract = {Sweeping a collection of figures in the Euclidean plane with a straight line is one of the novel algorithmic paradigms that have emerged in the field of computational geometry. In this paper we demonstrate the advantages of sweeping with a topological line that is not necessarily straight. We show how an arrangement of n lines in the plane can be swept over in O(n2) time and O(n) space by a such a line. In the process each element, i.e., vertex, edge, or region, is visited once in a consistent ordering. Our technique makes use of novel data structures which exhibit interesting amortized complexity behavior; the result is an algorithm that improves upon all its predecessors either in the space or the time bounds, as well as being eminently practical. Numerous applications of the technique to problems in computational geometry are given—many through the use of duality transforms. Examples include solving visibility problems, detecting degeneracies in configurations, computing the extremal shadows of convex polytopes, and others. Even though our basic technique solves a planar problem, its applications include several problems in higher dimensions.},
author = {Herbert Edelsbrunner and Guibas, Leonidas J},
journal = {Journal of Computer and System Sciences},
number = {1},
pages = {165 -- 194},
publisher = {Elsevier},
title = {{Topologically sweeping an arrangement}},
doi = {10.1016/0022-0000(89)90038-X},
volume = {38},
year = {1989},
}
@article{4083,
abstract = {It is shown that, given a set S of n points in $R^3 $, one can always find three planes that form an eight-partition of S, that is, a partition where at most ${n / 8}$ points of S lie in each of the eight open regions. This theorem is used to define a data structure, called an octant tree, for representing any point set in $R^3 $. An octant tree for n points occupies $O(n)$ space and can be constructed in polynomial time. With this data structure and its refinements, efficient solutions to various range query problems in two and three dimensions can be obtained, including (1) half-space queries: find all points of S that lie to one side of any given plane; (2) polyhedron queries: find all points that lie inside (outside) any given polyhedron; and (3) circle queries in $R^2 $: for a planar set S, find all points that lie inside (outside) any given circle. The retrieval time for all these queries is $T(n) = O(n^\alpha + m)$, where $\alpha = 0.8988$ (or 0.8471 in case (3)), and m is the size of the output. This performance is the best currently known for linear-space data structures that can be deterministically constructed in polynomial time.},
author = {Yao, F. Frances and Dobkin, David P and Herbert Edelsbrunner and Paterson,Michael S},
journal = {SIAM Journal on Computing},
number = {2},
pages = {371 -- 384},
publisher = {SIAM},
title = {{Partitioning space for range queries}},
doi = {10.1137/0218025},
volume = {18},
year = {1989},
}
@article{4084,
abstract = {A tour of a finite set P of points is a necklace-tour if there are disks with the points in P as centers such that two disks intersect if and only if their centers are adjacent in . It has been observed by Sanders that a necklace-tour is an optimal traveling salesman tour.
In this paper, we present an algorithm that either reports that no necklace-tour exists or outputs a necklace-tour of a given set of n points in O(n2 log n) time. If a tour is given, then we can test in O(n2) time whether or not this tour is a necklace-tour. Both algorithms can be generalized to ƒ-factors of point sets in the plane. The complexity results rely on a combinatorial analysis of certain intersection graphs of disks defined for finite sets of points in the plane.},
author = {Herbert Edelsbrunner and Rote,Günter and Welzl, Emo},
journal = {Theoretical Computer Science},
number = {2},
pages = {157 -- 180},
publisher = {Elsevier},
title = {{Testing the necklace condition for shortest tours and optimal factors in the plane}},
doi = {10.1016/0304-3975(89)90133-3},
volume = {66},
year = {1989},
}
@inproceedings{4085,
abstract = {Let C be a cell complex in d-dimensional Euclidean space whose faces are obtained by orthogonal projection of the faces of a convex polytope in d + 1 dimensions. For example, the Delaunay triangulation of a finite point set is such a cell complex. This paper shows that the in_front/behind relation defined for the faces of C with respect to any fixed viewpoint x is acyclic. This result has applications to hidden line/surface removal and other problems in computational geometry.},
author = {Herbert Edelsbrunner},
pages = {145 -- 151},
publisher = {ACM},
title = {{An acyclicity theorem for cell complexes in d dimension}},
doi = {10.1145/73833.73850},
year = {1989},
}
@article{4086,
abstract = {This note proves that the maximum number of faces (of any dimension) of the upper envelope of a set ofn possibly intersectingd-simplices ind+1 dimensions is (n d (n)). This is an extension of a result of Pach and Sharir [PS] who prove the same bound for the number ofd-dimensional faces of the upper envelope.},
author = {Herbert Edelsbrunner},
journal = {Discrete & Computational Geometry},
number = {4},
pages = {337 -- 343},
publisher = {Springer},
title = {{The upper envelope of piecewise linear functions: Tight bounds on the number of faces }},
doi = {10.1007/BF02187734},
volume = {4},
year = {1989},
}
@inproceedings{4087,
abstract = {This paper offers combinatorial results on extremum problems concerning the number of tetrahedra in a tetrahedrization of n points in general position in three dimensions, i.e. such that no four points are coplanar. It also presents an algorithm that in O(nlog n) time constructs a tetrahedrization of a set of n points consisting of at most 3n–11 tetrahedra.},
author = {Herbert Edelsbrunner and Preparata, Franco P and West, Douglas B},
pages = {315 -- 331},
publisher = {Springer},
title = {{Tetrahedrizing point sets in three dimensions}},
doi = {10.1007/3-540-51084-2_31},
volume = {358},
year = {1989},
}
@article{4088,
abstract = {Anarrangement ofn lines (or line segments) in the plane is the partition of the plane defined by these objects. Such an arrangement consists ofO(n 2) regions, calledfaces. In this paper we study the problem of calculating and storing arrangementsimplicitly, using subquadratic space and preprocessing, so that, given any query pointp, we can calculate efficiently the face containingp. First, we consider the case of lines and show that with (n) space1 and (n 3/2) preprocessing time, we can answer face queries in (n)+O(K) time, whereK is the output size. (The query time is achieved with high probability.) In the process, we solve three interesting subproblems: (1) given a set ofn points, find a straight-edge spanning tree of these points such that any line intersects only a few edges of the tree, (2) given a simple polygonal path , form a data structure from which we can find the convex hull of any subpath of quickly, and (3) given a set of points, organize them so that the convex hull of their subset lying above a query line can be found quickly. Second, using random sampling, we give a tradeoff between increasing space and decreasing query time. Third, we extend our structure to report faces in an arrangement of line segments in (n 1/3)+O(K) time, given(n 4/3) space and (n 5/3) preprocessing time. Lastly, we note that our techniques allow us to computem faces in an arrangement ofn lines in time (m 2/3 n 2/3+n), which is nearly optimal.},
author = {Herbert Edelsbrunner and Guibas, Leonidas and Hershberger, John and Seidel, Raimund and Sharir, Micha and Snoeyink, Jack and Welzl, Emo},
journal = {Discrete & Computational Geometry},
number = {1},
pages = {433 -- 466},
publisher = {Springer},
title = {{Implicitly representing arrangements of lines or segments}},
doi = {10.1007/BF02187742},
volume = {4},
year = {1989},
}