Sciweavers

1884 search results - page 145 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
136
Voted
IPL
2002
119views more  IPL 2002»
15 years 2 months ago
Randomized splay trees: Theoretical and experimental results
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
Susanne Albers, Marek Karpinski
100
Voted
MFCS
1994
Springer
15 years 6 months ago
"The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams
We show that the wavefront approach to Voronoi diagrams (a deterministic line sweep algorithm that does not use geometric transform) can be generalized to distance measures more g...
Frank K. H. A. Dehne, Rolf Klein
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 3 months ago
Maintaining deforming surface meshes
We present a method to maintain a mesh approximating a deforming surface, which is specified by a dense set of sample points. We identify a reasonable motion model for which a pro...
Siu-Wing Cheng, Tamal K. Dey
ESA
2010
Springer
142views Algorithms» more  ESA 2010»
15 years 3 months ago
The Geodesic Diameter of Polygonal Domains
This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simple polygons (i.e., h = 0), it is known that the geodesic diameter is determined...
Sang Won Bae, Matias Korman, Yoshio Okamoto
JDA
2007
83views more  JDA 2007»
15 years 2 months ago
Optimal leaf ordering of complete binary trees
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
Ulrik Brandes