@inproceedings{4071,
  abstract     = {We show that a triangulation of a set of n points in the plane that minimizes the maximum angle can be computed in time O(n2 log n) and space O(n). In the same amount of time and space we can also handle the constrained case where edges are prescribed. The algorithm iteratively improves an arbitrary initial triangulation and is fairly easy to implement.},
  author       = {Edelsbrunner, Herbert and Tan, Tiow and Waupotitsch, Roman},
  booktitle    = {Proceedings of the 6th annual symposium on Computational geometry},
  isbn         = {978-0-89791-362-1},
  location     = {Berkley, CA, United States},
  pages        = {44 -- 52},
  publisher    = {ACM},
  title        = {{An O(n^2log n) time algorithm for the MinMax angle triangulation}},
  doi          = {10.1145/98524.98535},
  year         = {1990},
}

@inproceedings{4076,
  abstract     = {We present an algorithm to compute a Euclidean minimum spanning tree of a given set S of n points in Ed in time O(Td(N, N) logd N), where Td(n, m) is the time required to compute a bichromatic closest pair among n red and m blue points in Ed. If Td(N, N) = Ω(N1+ε), for some fixed ε > 0, then the running time improves to O(Td(N, N)). Furthermore, we describe a randomized algorithm to compute a bichromatic closets pair in expected time O((nm log n log m)2/3+m log2 n + n log2 m) in E3, which yields an O(N4/3log4/3 N) expected time algorithm for computing a Euclidean minimum spanning tree of N points in E3.},
  author       = {Agarwal, Pankaj and Edelsbrunner, Herbert and Schwarzkopf, Otfried and Welzl, Emo},
  booktitle    = {Proceedings of the 6th annual symposium on Computational geometry},
  isbn         = {978-0-89791-362-1},
  location     = {Berkeley, CA, United States},
  pages        = {203 -- 210},
  publisher    = {ACM},
  title        = {{ Euclidean minimum spanning trees and bichromatic closest pairs}},
  doi          = {10.1145/98524.98567},
  year         = {1990},
}

@inproceedings{4077,
  abstract     = {We prove that for any set S of n points in the plane and n3-α triangles spanned by the points of S there exists a point (not necessarily of S) contained in at least n3-3α/(512 log25 n) of the triangles. This implies that any set of n points in three - dimensional space defines at most 6.4n8/3 log5/3 n halving planes.},
  author       = {Aronov, Boris and Chazelle, Bernard and Edelsbrunner, Herbert and Guibas, Leonidas and Sharir, Micha and Wenger, Rephael},
  booktitle    = {Proceedings of the 6th annual symposium on Computational geometry},
  isbn         = {978-0-89791-362-1},
  location     = {Berkley, CA, United States},
  pages        = {112 -- 115},
  publisher    = {ACM},
  title        = {{Points and triangles in the plane and halving planes in space}},
  doi          = {10.1145/98524.98548},
  year         = {1990},
}

@inproceedings{4078,
  abstract     = {In this paper we derived combinatorial point selection results for geometric objects defined by pairs of points. In a nutshell, the results say that if many pairs of a set of n points in some fixed dimension each define a geometric object of some type, then there is a point covered by many of these objects. Based on such a result for three-dimensional spheres we show that the combinatorial size of the Delaunay triangulation of a point set in space can be reduced by adding new points. We believe that from a practical point of view this is the most important result of this paper.},
  author       = {Chazelle, Bernard and Edelsbrunner, Herbert and Guibas, Leonidas and Hershberger, John and Seidel, Raimund and Sharir, Micha},
  booktitle    = {Proceedings of the 6th annual symposium on computational geometry},
  isbn         = {978-0-89791-362-1},
  location     = {Berkley, CA, United States},
  pages        = {116 -- 127},
  publisher    = {ACM},
  title        = {{Slimming down by adding; selecting heavily covered points}},
  doi          = {10.1145/98524.98551},
  year         = {1990},
}