The greedy triangulation (GT) of a set S of n points in the plane is the triangulation obtained by starting with the empty set and at each step adding the shortest compatible edge between two of the points, where a compatible edge is de ned to be an edge that crosses none of the previously added edges. In this paper we present a simple, practical algorithm that computes the greedy triangulation...

scott and szewczyk in technometrics, 2001, have introduced a similarity measure for twodensities f1 and f2 , by1, 21 21 1 2 2( , ), ,f fsim f ff f f f< >=< >< >wheref1, f2 f1(x, θ1)f2(x, θ2)dx.+∞−∞< >=∫sim(f1, f2) has some appropriate properties that can be suitable measures for the similarity of f1 and f2 .however, due to some restrictions on the value of parameters and the kind of densities, ...

0