@inproceedings{3513,
  author       = {Dobkin, David and Edelsbrunner, Herbert},
  booktitle    = {9th International Workshop on Graph Theoretic Concepts in Computer Science},
  isbn         = {3-853-20311-6},
  location     = {Haus Ohrbeck, Germany},
  pages        = {88 -- 99},
  publisher    = {Teubner},
  title        = {{Ham-sandwich theorems applied to intersection problems}},
  year         = {1984},
}

@article{4117,
  abstract     = {Two or more geometrical objects (solids) are said to be connected whenever their union is a connected point set in the usual sense. Sets of geometrical objects are naturally divided into connected components, which are maximal connected subsets. We show that the connected components of a given collection of n horizontal and vertical line segments in the plane can be computed in O (n log n) time and O (n) space and prove that this is essentially optimal. The result is generalized to compute the connected components of a set of n rectilinearly-oriented rectangles
in the plane with the same time and space bounds. Several extensions of the results to higher dimensions and to dynamic sets of objects are discussed.},
  author       = {Edelsbrunner, Herbert and Van Leeuwen, Jan and Ottmann, Thomas and Wood, Derick},
  issn         = {1290-385X},
  journal      = {Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications},
  number       = {2},
  pages        = {171 -- 183},
  publisher    = {EDP Sciences},
  title        = {{Computing the connected components of simple rectilinear geometrical objects in D-Space}},
  doi          = {10.1051/ita/1984180201711},
  volume       = {18},
  year         = {1984},
}

@article{4118,
  abstract     = {A rectilinear polygon can be viewed as an art gallery room whose walls meet at right angles. An algorithm is presented that stations guards in such a room so that every interior point is visible to some guard. The algorithm partitions the polygon into L-shaped pieces, a subclass of star-shaped pieces, and locates one guard within each kernel. The algorithm runs in O(n log n) time in the worst case for a polygon of n vertices.},
  author       = {Edelsbrunner, Herbert and O'Rourke, Joseph and Welzl, Emo},
  issn         = {0734-189X},
  journal      = {Computer Vision, Graphics, and Image Processing},
  number       = {2},
  pages        = {167 -- 176},
  publisher    = {Elsevier},
  title        = {{Stationing guards in rectilinear art galleries}},
  doi          = {10.1016/S0734-189X(84)80041-9},
  volume       = {27},
  year         = {1984},
}

@inproceedings{4119,
  author       = {Edelsbrunner, Herbert and Welzl, Emo},
  booktitle    = {11th International Symposium on Mathematical Foundations of Computer Science},
  isbn         = {3-540-13372-0},
  location     = {Praha, Czechoslovakia},
  pages        = {265 -- 272},
  publisher    = {Springer},
  title        = {{Monotone edge sequences in line arrangements and applications}},
  doi          = {10.1007/BFb0030307},
  volume       = {176},
  year         = {1984},
}

@article{4121,
  abstract     = {Whenevern objects are characterized by a matrix of pairwise dissimilarities, they may be clustered by any of a number of sequential, agglomerative, hierarchical, nonoverlapping (SAHN) clustering methods. These SAHN clustering methods are defined by a paradigmatic algorithm that usually requires 0(n 3) time, in the worst case, to cluster the objects. An improved algorithm (Anderberg 1973), while still requiring 0(n 3) worst-case time, can reasonably be expected to exhibit 0(n 2) expected behavior. By contrast, we describe a SAHN clustering algorithm that requires 0(n 2 logn) time in the worst case. When SAHN clustering methods exhibit reasonable space distortion properties, further improvements are possible. We adapt a SAHN clustering algorithm, based on the efficient construction of nearest neighbor chains, to obtain a reasonably general SAHN clustering algorithm that requires in the worst case 0(n 2) time and space.
Whenevern objects are characterized byk-tuples of real numbers, they may be clustered by any of a family of centroid SAHN clustering methods. These methods are based on a geometric model in which clusters are represented by points ink-dimensional real space and points being agglomerated are replaced by a single (centroid) point. For this model, we have solved a class of special packing problems involving point-symmetric convex objects and have exploited it to design an efficient centroid clustering algorithm. Specifically, we describe a centroid SAHN clustering algorithm that requires 0(n 2) time, in the worst case, for fixedk and for a family of dissimilarity measures including the Manhattan, Euclidean, Chebychev and all other Minkowski metrics.},
  author       = {Day, William and Edelsbrunner, Herbert},
  issn         = {1432-1343},
  journal      = {Journal of Classification},
  pages        = {7 -- 24},
  publisher    = {Springer},
  title        = {{Efficient algorithms for agglomerative hierarchical clustering methods}},
  doi          = {10.1007/BF01890115},
  volume       = {1},
  year         = {1984},
}

@inproceedings{4122,
  abstract     = {Computational geometry, considered a subfield of computer science, is concerned with the computational aspects of geometric problems. The increasing activity in this rather young field made it split into several reasonably independent subareas. This paper presents several key-problems of the classical part of computational geometry which exhibit strong interrelations. A unified view of the problems is stressed, and the general ideas behind the methods that solve them are worked out.},
  author       = {Edelsbrunner, Herbert},
  booktitle    = {1st Symposium of Theoretical Aspects of Computer Science},
  isbn         = {3-540-12920-0},
  location     = {Paris, France},
  pages        = {1 -- 13},
  publisher    = {Springer},
  title        = {{Key-problems and key-methods in computational geometry}},
  doi          = {10.1007/3-540-12920-0_1},
  volume       = {166},
  year         = {1984},
}

@article{4123,
  abstract     = {Windowing a two-dimensional picture means to determine those line segments of the picture that are visible through an axis-parallel window. A study of some algorithmic problems involved in windowing a picture is offered. Some methods from computational geometry are exploited to store the picture in a computer such that (1) those line segments inside or partially inside of a window can be determined efficiently, and (2) the set of those line segments can be maintained efficiently while the window is moved parallel to a coordinate axis and/or it is enlarged or reduced.},
  author       = {Edelsbrunner, Herbert and Overmars, Mark and Seidel, Raimund},
  issn         = {1557-895X},
  journal      = {Computer Vision, Graphics, and Image Processing},
  number       = {1},
  pages        = {92 -- 108},
  publisher    = {Elsevier},
  title        = {{Some methods of computational geometry applied to computer graphics}},
  doi          = {10.1016/0734-189X(84)90142-7},
  volume       = {28},
  year         = {1984},
}

@article{4327,
  author       = {Barton, Nicholas H and Charlesworth, Brian},
  issn         = {1545-2069},
  journal      = {Annual Review of Ecology and Systematics},
  pages        = {133 -- 164},
  publisher    = {Annual Reviews},
  title        = {{Genetic revolutions, founder effects, and speciation}},
  doi          = {10.1146/annurev.es.15.110184.001025},
  volume       = {15},
  year         = {1984},
}