Given a family of k disjoint connected polygonal sites in general position and of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest point on it. We show that the complexity of this diagram is O(n), and give an O(n log n) time algorithm to compute it. We also prove a number of structural properties of this ...

Features representing information of High Pressure Points from a static image of a handwritten signature are analyzed for an offline verification system. From grayscale images, a new approach for High Pressure threshold estimation is proposed. Two images, one containing the High Pressure Points extracted and other with a binary version of the original signature, are transformed to polar coordin...

Given a set of point sites in a simple polygon, the geodesic farthest-point Voronoi diagram partitions the polygon into cells, at most one cell per site, such that every point in a cell has the same farthest site with respect to the geodesic metric. We present an O(n log log n+m logm)time algorithm to compute the geodesic farthest-point Voronoi diagram of m point sites in a simple n-gon. This i...

The problem of finding a minimum spaYlning tree connecting n points in a k-dimensional space is discussed under three comon distance metrics -Euclidean, rectilinear, and L . co By employing a subroutine that -=. solves the post office problem, we show that, for fixed k 2 3 , such a minimum spanning tree can be found in time O(n2’&Ck)(log n)l-a(k)) 9 where a(k) = 2 -(k+l) 1.8 . The bound can be ...

1 The farthest-point Voronoi diagram of a set of n sites 2 is a tree with n leaves. We investigate whether arbi3 trary trees can be realized as farthest-point Voronoi di4 agrams. Given an abstract ordered tree T with n leaves 5 and prescribed edge lengths, we produce a set of n sites 6 S in O(n) time such that the farthest-point Voronoi di7 agram of S represents T . We generalize this algorithm...

This paper presents a novel method for people counting in crowded scenes that combines the information gathered by multiple cameras to mitigate the problem of occlusion that commonly affects the performance of counting methods using single cameras. The proposed method detects the corner points associated to the people present in the scene and computes their motion vector. During the training st...

Ear biometric for identification of human is quite complex task. It’s use either uni-modal or multi-modal approach in order to authenticate a person. A uni-modal biometric system involves a single source of biometric to identify a person. This paper is based on uni-modal approach with ear as a biometric trait for recognizing a person. In this paper, an experimental approach is used for identify...

Metric based comparison operations such as finding maximum, nearest and farthest neighbor are fundamental to studying various clustering techniques k -center agglomerative hierarchical clustering. These crucially rely on accurate estimation of pairwise distance between records. However, computing exact features the records, their distances is often challenging, sometimes not possible. We circum...

PURPOSE To investigate the effect of hinge position on corneal topography after laser in situ keratomileusis (LASIK) for myopia. SETTING Academic center and refractive surgery practice. METHODS Topography data obtained from 89 eyes of 46 patients after LASIK were analyzed. Using a system of Cartesian coordinates, data along the horizontal and vertical axes were analyzed, measuring sagittal ...

Suppose there are k types of facilities, e. g. schools, post offices, supermarkets, modeled by n colored points in the plane, each type by its own color. One basic goal in choosing a residence location is in having at least one representative of each facility type in the neighborhood. In this paper we provide algorithms that may help to achieve this goal for various specifications of the term “...