_ The reverse search technique has been recently introduced by the authors for eflicicnt enumeration of vertices of polyhedra and arrangements. In this paper, we develop this idea in a generalâ€¦ (More)

Automatic computer processing of large multidimensional images such as those produced by magnetic resonance imaging (MRI) is greatly aided by deformable models, which are used to extract, identify,â€¦ (More)

We present a ne w piv ot-based algorithm which can be used with minor modification for the enumeration of the facets of the con vex hull of a set of points, or for the enumeration of the vertices ofâ€¦ (More)

In many computer applications areas such as graphics, automated cartography, image processing, and robotics the notion of visibility among objects modeled as polygons is a recurring theme. This paperâ€¦ (More)

This paper describes an impro ved implementation of the re v rse search v ertex enumeration/con vex hull algorithm ford-dimensional con vex polyhedra. The implementation uses a lexicographic ratioâ€¦ (More)

We introduce the unoriented Î˜-maximum as a new criterion for describing the shape of a set of planar points. We present efficient algorithms for computing the unoriented Î˜-maximum of a set of planarâ€¦ (More)

This survey paper reviews results on heuristics for two weighted matching problems: matchings where the vertices are points in the plane and weights are Euclidean distances, and the assignmentâ€¦ (More)

Afi nite metric (or more properly semimetric) on n points is a non-negative vector d = (d ij)1â‰¤ i < j â‰¤ n that satisfies the triangle inequality: d ij â‰¤ d ik + d jk .The L 1 (or Manhattan)distance |â€¦ (More)