Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
3D scanning techniques based on structured light usually achieve robustness against outliers by performing multiple projections to simplify correspondence. However, for cases such...
Recognizing commonly used data structures and algorithms is a key activity in reverse engineering. Systems developed to automate this recognition process have been isolated, stand...
A new graph algorithm for multiscale segmentation of threedimensional medical data sets is presented. It is a threedimensional generalisation of an existing two-dimensional Mumfor...