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 ...
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...
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...
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 ...
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...