David Avis | Academic Influence

David Avis's AcademicInfluence.com Rankings

David Avis

Mathematics

#2550

World Rank

#3914

Historical Rank

Measure Theory

#2566

World Rank

#3075

Historical Rank

mathematics Degrees

Download Badge

Mathematics

David Avis's Degrees

PhD Mathematics University of Southampton
Bachelors Mathematics University of Southampton

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is David Avis Influential?

(Suggest an Edit or Addition)

According to Wikipedia, David Michael Avis is a Canadian and British computer scientist known for his contributions to geometric computations. Avis is a professor in computational geometry and applied mathematics in the School of Computer Science, McGill University, in Montreal. Since 2010, he belongs to Department of Communications and Computer Engineering, School of Informatics, Kyoto University.

(See a Problem?)

David Avis's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Automated 3-D Extraction of Inner and Outer Surfaces of Cerebral Cortex from MRI (2000) (901)
Reverse Search for Enumeration (1996) (783)
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (1991) (616)
How good are convex hull algorithms? (1995) (313)
A Linear Algorithm for Computing the Visibility Polygon from a Point (1981) (266)
A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm (2000) (195)
Multiple surface identification and matching in magnetic resonance images (1994) (178)
An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge (1981) (177)
A Linear Algorithm for Finding the Convex Hull of a Simple Polygon (1979) (148)
Enumeration of Nash equilibria for two-player games (2010) (111)
On a convex hull algorithm for polygons and its application to triangulation problems (1982) (104)
Ground metric learning (2011) (99)
An efficient algorithm for decomposing a polygon into star-shaped polygons (1981) (96)
A method for identifying geometrically simple surfaces from three-dimensional images (1998) (92)
lrs : A Revised Implementation of the Rev rse Search Vertex Enumeration Algorithm (1998) (80)
On the Extreme Rays of the Metric Cone (1980) (77)
Diameter partitioning (1986) (54)
On the extension complexity of combinatorial polytopes (2013) (54)
Hypermetric Spaces and the Hamming Cone (1981) (53)
The cut cone, L1 embeddability, complexity, and multicommodity flows (1991) (52)
On the relationship between convex bodies related to correlation experiments with dichotomic observables (2006) (50)
Computing the largest empty convex subset of a set of points (1985) (50)
A Quantum Protocol to Win the Graph Colouring Game on All Hadamard Graphs (2005) (49)
Two-party Bell inequalities derived from combinatorics via triangular elimination (2005) (46)
Leggett-Garg inequalities and the geometry of the cut polytope (2010) (44)
Triangulating point sets in space (1987) (44)
REMARKS ON THE SPHERE OF INFLUENCE GRAPH (1985) (39)
On canonical representations of convex polyhedra (2002) (38)
Distributed compression and multiparty squashed entanglement (2007) (36)
Graph theory and combinatorial optimization (2005) (35)
Non-Partitionable Point Sets (1984) (35)
Lower Bounds for Line Stabbing (1989) (35)
Proximity Constraints in Deformable Models for Cortical Surface Identification (1998) (33)
Algorithms for high dimensional stabbing problems (1990) (32)
A combinational approach to polygon similarity (1983) (32)
Generating rooted triangulations without repetitions (1996) (31)
On the multimodality of distances in convex polygons (1982) (30)
An analysis of a decomposition heuristic for the assignment problem (1985) (30)
All the Facets of the Six-point Hamming Cone (1989) (29)
Computational experience with the reverse search vertex enumeration algorithm (1998) (28)
A list heuristic for vertex cover (2007) (27)
Unoriented Theta-Maxima in the Plane: Complexity and Algorithms (1999) (26)
Computing the volume of the union of spheres (1988) (26)
Algorithms for line transversals in space (1987) (26)
Polyhedral line transversals in space (1988) (26)
Simple On-Line Algorithms for Convex Polygons (1985) (25)
Eccentric graphs (1985) (24)
On the existence of a point subset with a specified number of interior points (2001) (24)
On the complexity of vertex and facet enumeration for convex polytopes (1998) (23)
mplrs: A scalable parallel vertex/facet enumeration code (2015) (23)
A C Implementation of the Reverse Search Vertex Enumeration Algorithm(Computational Geometry and Discrete Geometry) (1994) (20)
Comments on a Lower Bound for Convex Hull Determination (1980) (20)
Estimating the number of vertices of a polyhedron (2000) (20)
Deriving Tight Bell Inequalities for 2 Parties with Many 2-valued Observables from Facets of Cut Polytopes (2004) (19)
Miscellaneous Properties Of Equi-Eccentric Graphs (1984) (18)
A basis enumeration algorithm for linear systems with geometric applications (1991) (18)
The Number of Furthest Neighbour Pairs of a Finite Planar Set (1984) (17)
Solving Inequalities and Proving Farkas's Lemma Made Easy (2002) (17)
On the sectional area of convex polytopes (1996) (17)
Repeated distances in space (1988) (17)
Computational aspects of Helly's theorem and its relatives (1995) (17)
Bell inequalities stronger than the Clauser-Horne-Shimony-Holt inequality for three-level isotropic states (2005) (16)
On the Existence of a Point Subset with 4 or 5 Interior Points (1998) (16)
A Bound on the K-gonality of Facets of the Hypermetric Cone and Related Complexity Problems (1993) (16)
Enumerating Constrained Non-crossing Minimally Rigid Frameworks (2006) (14)
Enumeration of optimal pin-jointed bistable compliant mechanisms with non-crossing members (2009) (14)
Distinct Distances Determined By Subsets of a Point Set in Space (1991) (14)
Triangulating simplicial point sets in space (1986) (13)
Extremal Metrics Induced by Graphs (1980) (12)
On the partitionability of point sets in space (preliminary report) (1985) (12)
Generating facets for the cut polytope of a graph by triangular elimination (2006) (12)
Review: Joseph O'Rourke, Art gallery theorems and algorithms (1990) (11)
The m-core properly contains the m-divisible points in space (1993) (10)
Locating a Robot with Angle Mathematics (1990) (10)
On the foundations and extremal structure of the holographic entropy cone (2021) (10)
Enumerating Non-crossing Minimally Rigid Frameworks (2006) (10)
On the solitaire cone and its relationship to multi-commodity flows (2001) (10)
Living with lrs (1998) (10)
New classes of facets of the cut polytope and tightness of Imm22 Bell inequalities (2007) (9)
From Bell Inequalities to Tsirelson's Theorem (2008) (9)
A parallel framework for reverse search using mts (2016) (9)
Comparative computational results for some vertex and facet enumeration codes (2015) (9)
On minimal 5-chromatic triangle-free graphs (1979) (9)
On the Complexity of Isometric Embedding in the Hypercube (1990) (8)
An Ω(n2 log n) lower bound to the shortest paths problem (1977) (8)
Visibility between two edges of a simple polygon (1986) (8)
A generalization of extension complexity that captures P (2014) (8)
Applications of a two-dimensional hidden-line algorithm to other geometric problems (1983) (8)
Comparison of two bounds of the quantum correlation set (2007) (6)
A Portable Parallel Implementation of the lrs Vertex Enumeration Code (2013) (6)
On the binary solitaire cone (2001) (6)
On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities (2002) (6)
Automatic Segmentation of Cortical Surfaces from MRI with Partial-Volume Correction (1998) (5)
On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes (2011) (4)
Polynomial size linear programs for non-bipartite matching problems and other problems in P (2014) (4)
Metric extensions and the L1 hierarchy (1994) (4)
An Analysis of Budgeted Parallel Search on Conditional Galton–Watson Trees (2017) (4)
Computing Monotone Simple Circuits in the Plane (1988) (4)
mts: a light framework for parallelizing tree search codes (2017) (4)
Enumerating Planar Minimally Rigid Graphs (2005) (4)
On the fractional chromatic index of a graph and its complement (2005) (3)
New Classes of Facets of Cut Polytope and Tightness of I_{mm22} Bell Inequalities (2005) (3)
A Combinatorial Approach to the Solitaire Game (2000) (3)
Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs (2011) (3)
A package for triangulations (1996) (3)
Compact linear programs for 2SAT (2017) (2)
Reputation games for undirected graphs (2012) (2)
Surface segementation and matching by 3D deformation (1996) (2)
On Reconfiguration Graph of Independent Sets under Token Sliding (2022) (2)
Algorithmic enumeration of surrounding polygons (2020) (2)
On the directed cut cone and polytope (2016) (2)
Visualizing and Constructing Cycles in the Simplex Method (2005) (2)
Generating Rooted Triangulations with Minimum Degree Four (1996) (2)
The Quantum Locker Puzzle (2008) (2)
Computing Disjoint Paths on Polytopes (2005) (1)
Computing monotone disjoint paths on polytopes (2008) (1)
Worst-case Behaviour of History Based Pivot Rules on Acyclic Unique Sink Orientations of Hypercubes (2011) (1)
The Locker Problem with Empty Lockers (2009) (1)
Postscript to "What is the worst case behavior of the simplex algorithm?" (2009) (1)
George Dantzig: father of the simplex method (2015) (1)
A Note On Acyclic Token Sliding Reconfiguration Graphs of Independent Sets (2023) (1)
Miscellaneous Properties on Equi-Eccentric Graphs (Applied Combinatorial Theory and Algorithms) (1981) (1)
Polynomial size linear programs for problems in P (2014) (1)
Space Partitioning and its Application to Generalized Retrieval Problems (1985) (1)
A family of polytopal digraphs that do not satisfy the shelling property (2009) (1)
On Radius Critical Graphs (1982) (0)
Large convex hull problems (1996) (0)
Families of polytopal digraphs that do not satisfy the shelling property (2011) (0)
Polyhedral and semidefinite approaches to classical and quantum Bell inequalities (2006) (0)
Title Enumerating Constrained Non-crossing Minimally Rigid Frameworks (2016) (0)
mplrs: A scalable parallel vertex/facet enumeration code (2017) (0)
On the $${\mathcal {H}}$$H-free extension complexity of the TSP (2015) (0)
On the directed cut cone and polytope (2015) (0)
Generating Rooted Triangulations Without Repetitions 1 (2005) (0)
Book Review: Art gallery theorems and algorithms (1990) (0)
5. References 4. Concluding Remarks (1984) (0)
On the H-Free Extension Complexity of the TSP (2015) (0)
123 Optimal Design of Flexible Structures utilizing Enumeration Algorithms for Rigid Framework (2006) (0)
New y ! rtk Inc , ~ Polyhedral Line Transversals in Space (2005) (0)
124 Enumerating Non-crossing Minimally Rigid Frameworks for Mechanism Optimization Problems (2006) (0)
Those ubiquitous cut polyhedra (2010) (0)
O C ] 1 8 A pr 2 01 8 Compact linear programs for 2 SAT (2018) (0)
Multiparty Distributed Compression of Quantum Information (2008) (0)
A Package for Triangulations 3 (1996) (0)
Quantum Correlations : From Bell inequalities to Tsirelson ’ s theorem (2007) (0)
lrsarith: a small fixed/hybrid arithmetic C library (2021) (0)
05 08 21 0 v 2 2 5 Ja n 20 06 Bell inequalities stronger than the CHSH inequality for 3-level isotropic states (2022) (0)
On the extension complexity of combinatorial polytopes (2014) (0)
7. Acknowledgments 8. References 6. Concluding Remarks (1981) (0)
Sparktope: linear programs from algorithms (2020) (0)

This paper list is powered by the following services:

Other Resources About David Avis

en.wikipedia.org

What Schools Are Affiliated With David Avis?

David Avis is affiliated with the following schools:

Image Attributions

Image Source for David Avis