David Avis

Sort by:

David Avis, Komei Fukuda
Discrete Applied Mathematics
1996

_ 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)

Automated 3-D Extraction of Inner and Outer Surfaces of Cerebral Cortex from MRI

David A. Macdonald, N. Kabani, David Avis, Alan C. Evans
NeuroImage
2000

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)

A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra

David Avis, Komei Fukuda
Discrete & Computational Geometry
1992

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)

How Good Are Convex Hull Algorithms?

David Avis, David Bremner, Raimund Seidel
Comput. Geom.
1997

An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge

David Avis, Godfried T. Toussaint
IEEE Transactions on Computers
1981

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)

lrs : A Revised Implementation of the Rev rse Search Vertex Enumeration Algorithm

David Avis
1998

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)

Unoriented Theta-Maxima in the Plane: Complexity and Algorithms

David Avis, Bryan Beresford-Smith, +4 authors Binhai Zhu
SIAM J. Comput.
1998

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)

A survey of heuristics for the weighted matching problem

David Avis
Networks
1983

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)

Multiple surface identification and matching in magnetic resonance images

David A. Macdonald, David Avis, Alan C. Evans
1994

The cut cone, L1 embeddability, complexity, and multicommodity flows

David Avis, Michel Deza
Networks
1991

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)

Filter Results:

Publication Year

Publication Type

Co-author

Journals and Conferences