Sciweavers

WADS
1993
Springer
163views Algorithms» more  WADS 1993»
13 years 8 months ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian
WADS
1993
Springer
110views Algorithms» more  WADS 1993»
13 years 8 months ago
A Dynamic Separator Algorithm
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
Deganit Armon, John H. Reif
WADS
1993
Springer
87views Algorithms» more  WADS 1993»
13 years 8 months ago
A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms
Lars Arge, Mikael Knudsen, Kirsten Larsen
WADS
1993
Springer
136views Algorithms» more  WADS 1993»
13 years 8 months ago
Balanced Search Trees Made Simple
Abstract. As a contribution to the recent debate on simple implementations of dictionaries, we present new maintenancealgorithms for balanced trees. In terms of code simplicity, ou...
Arne Andersson
WADS
1993
Springer
115views Algorithms» more  WADS 1993»
13 years 8 months ago
Parallel Construction of Quadtrees and Quality Triangulations
We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time O(log n) for p...
Marshall W. Bern, David Eppstein, Shang-Hua Teng