Stefan Meiser

Learn More
Abstract Voronoi diagrams were introduced by R . Klein [Kle89b, Kle88a, Kle88b] as an axiomatic basis ofVoronoi diagrams. We show how to construct abstract Voronoi diagrams in time O(nlogn) by a randomized algorithm, which is based on Clarkson and Shor's randomized incremental construction technique [CS89]. The new algorithm has the following advantages(More)
The Delaunay Tree is a hierarchical data structure that has been introduced in [7] and analyzed in [6, 4]. For a given set of sites S in the plane and an order of insertion for these sites, the Delaunay Tree stores all the successive Delaunay triangulations. As proved before, the Delaunay Tree allows the insertion of a site in logarithmic expected time and(More)
Between January 1987 and August 1990, a total of 20 keratoplasties were performed in infants and children in the University Eye Hospital, Düsseldorf, accounting for 4% of all keratoplasties during this period. The indications included malformations of the anterior segment and central corneal opacities, mostly of herpetic or microbial etiology. The ages of(More)
The Delaunay Tree is a hierarchical data structure that has been introduced in [6] and analyzed in [7,4]. For a given set of sites S in the plane and an order of insertion for these sites, the Delaunay Tree stores all the successive Delaunay triangulations. As proved before, the Delaunay Tree allows the insertion of a site in logarithmic expected time and(More)