Sciweavers

564 search results - page 39 / 113
» Linear Time Algorithms for Exact Distance Transform
Sort
View
MFCS
1994
Springer
13 years 12 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
DBPL
2001
Springer
133views Database» more  DBPL 2001»
14 years 9 days ago
A Theory of Spatio-Temporal Database Queries
Abstract. We address a fundamental question concerning spatio-temporal database systems: “What are exactly spatio-temporal queries?” We define spatio-temporal queries to be co...
Floris Geerts, Sofie Haesevoets, Bart Kuijpers
MP
2002
143views more  MP 2002»
13 years 7 months ago
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
François Vanderbeck
SIAMREV
2010
140views more  SIAMREV 2010»
13 years 2 months ago
What Shape Is Your Conjugate? A Survey of Computational Convex Analysis and Its Applications
Computational Convex Analysis algorithms have been rediscovered several times in the past by researchers from different fields. To further communications between practitioners, we ...
Yves Lucet
COMPGEOM
2009
ACM
14 years 2 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi