Results
repositories = "SciDok, der Wissenschafts-Server der Universitaet des Saarlandes"
> : "Kaiserslautern ; Saarbrücken : DFKI, 1986"
(x)
1
Found 2 documents, displaying page 1 of 1
A lower bound for the complexity of the union-split-find problem
Description :
We prove a Theta(loglog n) (i.e. matching upper and lower) bound on the complexity of the Union-Split-Find problem, a variant of the Union-Find problem. Our lower bound holds for all pointer machine algorithms and does not require the separation assumption used in the lower bound arguments of Tarjan...
Repository :
SciDok, der Wissenschafts-Server der Universitaet des Saarlandes
Language(s) :
English
New algorithms for shortest paths avoiding convex polygonal obstacles
Author(s) :
Rohnert, Hans
Description :
Two algorithms are presented for computing shortest paths in the plane avoiding convex polygonal obstacles. For the first algorithm the obstacles are assumed to consist of f disjoint convex polygons, for the second algorithm the f polygons may intersect pairwise at most twice. For finding the shorte...
Repository :
SciDok, der Wissenschafts-Server der Universitaet des Saarlandes
Language(s) :
English
1
Found 2 documents, displaying page 1 of 1