Sciweavers

1728 search results - page 121 / 346
» The Accelerated Euclidean Algorithm
Sort
View
FOCS
1994
IEEE
15 years 6 months ago
Randomized and deterministic algorithms for geometric spanners of small diameter
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid
COMGEO
1999
ACM
15 years 2 months ago
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid
EOR
2010
159views more  EOR 2010»
14 years 10 months ago
An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the wor...
Nabila Azi, Michel Gendreau, Jean-Yves Potvin
ICMCS
2006
IEEE
97views Multimedia» more  ICMCS 2006»
15 years 9 months ago
Fast Progressive Model Refinement Global Motion Estimation Algorithm with Prediction
Global Motion Estimation (GME) is an important part in the object-based applications. In this paper, a fast progressive model refinement (FPMR) GME algorithm is proposed. It can s...
Haifeng Wang, Jia Wang, Qingshan Liu, Hanqing Lu
SI3D
2005
ACM
15 years 8 months ago
A general algorithm for output-sensitive visibility preprocessing
Occlusion culling based on precomputed visibility information is a standard method for accelerating the rendering in real-time graphics applications. In this paper we present a ne...
Samuli Laine