Sciweavers

Share
19 search results - page 3 / 4
» esa 2000
Sort
View
ESA
2000
Springer
124views Algorithms» more  ESA 2000»
10 years 8 months ago
Higher Order Delaunay Triangulations
For a set P of points in the plane, we introduce a class of triangulations that is an extension of the Delaunay triangulation. Instead of requiring that for each triangle the circ...
Joachim Gudmundsson, Mikael Hammar, Marc J. van Kr...
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
10 years 8 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
10 years 8 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
10 years 9 months ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
10 years 9 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
books