Tetsuo Asano

TL;DR: A space filling curve (SFC) is a numbering of the cells of this grid with numbers from c+1 to c+N2, for some c≥0, if it can be recursively divided into four square RSFCs of equal size.

TL;DR: This work shows how to build, in O(n2) time and space, a data structure from which inO(n) time the authors can compute the visibility polygon of a given point with respect to the polygon collection, implying that the shortest path that connects two points in the plane and avoids the polygons in their collection can be computed inO (n 2) time.

TL;DR: An algorithm is presented which partitions a set of points in the plane into two subsets so that their larger diameter is minimized in time and the minimum intercluster distance is maximized.

TL;DR: This work shows how to build a data structure from which in O(n) time the authors can compute the visibility polygon of a given point with respect to the polygon collection, and implies that the shortest path that connects two points in the plane and avoids the polygons in their collection can be computed in O (n2) time.

TL;DR: This paper design a novel feature based on minutia neighborhood structure and a more stable triangulation algorithm (low-order Delaunay triangles), which are both insensitive to fingerprint distortion, which considerably narrows down the search space in fingerprint databases and is stable for various fingerprints.