Publication Type

Co-author

Journals and Conferences

Data Set Used

Key Phrases

The relative neighbourhood graph (RNG) of a set of n points on the plane is defined. The ability of the RNG to extract a perceptually meaningful structure from the set of points is briefly discussed and compared to that of two other graph structures: the minimal spanning tree (MST) and the Delaunay (Voronoi) triangulation (DT). It is shown that the RNG is a… (More)

This is a survey of results on neighborhood graphs The paper discusses properties bounds on the size algorithms and variants of the neighborhood graphs Numerous applications including computational morphology spatial analysis pattern classi cation and data bases for computer vision are described A rich bibliography of the subject concludes the paper… (More)

Shamos [1] recently showed that the diameter of a convex n-sided polygon could be computed in O(n) time using a very elegant and simple procedure which resembles rotating a set of calipers around the polygon once. In this paper we show that this simple idea can be generalized in two ways: several sets of calipers can be used simultaneously on one convex… (More)

A combinatorial classification and a phylogenetic analysis of the ten 12/8 time, seven-stroke bell rhythm timelines in African and Afro-American music are presented. New methods for rhythm classification are proposed based on measures of rhythmic oddity and off-beatness. These combinatorial classifications reveal several new uniqueness properties of the… (More)

The fertility of male workers exposed to mercury vapor or to manganese dust was assessed with the use of the questionnaire developed by Levine et al [1980]. In the mercury group (concentration of mercury in urine ranging from 5.1 to 272.1 micrograms/g creatinine), no statistically significant difference was found between the observed number of children and… (More)