Sciweavers

1274 search results - page 67 / 255
» The Geometry of Coin-Weighing Problems
Sort
View
COMPGEOM
2003
ACM
15 years 11 months ago
Finding a curve in a map
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran ...
DGCI
2003
Springer
15 years 11 months ago
Stability in Discrete Tomography: Linear Programming, Additivity and Convexity
The problem of reconstructing finite subsets of the integer lattice from X-rays has been studied in discrete mathematics and applied in several fields like image processing, data...
Sara Brunetti, Alain Daurat
CGF
2011
14 years 10 months ago
Intrinsic Shape Matching by Planned Landmark Sampling
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have bee...
Art Tevs, Alexander Berner, Michael Wand, Ivo Ihrk...
EUROPAR
2003
Springer
15 years 11 months ago
Two Dimensional Airfoil Optimisation Using CFD in a Grid Computing Environment
In this paper, a two-dimensional airfoil shape optimisation problem is investigated using CFD within a grid computing environment (GCE) implemented in Matlab. The feature-based par...
Wenbin Song, Andy J. Keane, M. Hakki Eres, Graeme ...
COMPGEOM
1995
ACM
15 years 9 months ago
Approximate Range Searching
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
Sunil Arya, David M. Mount