D
David Bremner
Researcher at University of New Brunswick
Publications - 80
Citations - 1651
David Bremner is an academic researcher from University of New Brunswick. The author has contributed to research in topics: Polytope & Polyhedron. The author has an hindex of 20, co-authored 80 publications receiving 1551 citations. Previous affiliations of David Bremner include IBM & University of Washington.
Papers
More filters
Journal ArticleDOI
How good are convex hull algorithms
TL;DR: This paper considers the main known classes of algorithms for solving convex polytope enumeration problems and argues that they all have at least one of two weaknesses: inability to deal well with “degeneracies”, or, inability to control the sizes of intermediate results.
Proceedings ArticleDOI
How good are convex hull algorithms
David Avis,David Bremner +1 more
TL;DR: This paper considers the main known classes of algorithms for solving convex polytope enumeration problems and argues that they all have at least one of two weaknesses inability to deal well with degen eracies or inability to control the sizes of intermediate results.
Journal ArticleDOI
Primal—Dual Methods for Vertex and Facet Enumeration
TL;DR: The known polynomially solvable classes of polytopes are extended by looking at the dual problems by proposing a new class of algorithms that take advantage of this phenomenon.
Journal ArticleDOI
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries
David Bremner,Erik D. Demaine,Jeff Erickson,John Iacono,Stefan Langerman,Pat Morin,Godfried G. Toussaint +6 more
TL;DR: Output-sensitive algorithms for computing this decision boundary for point sets on the line and in ℝ2 are developed, which is the best possible when parameterizing with respect to n and k.
Book ChapterDOI
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries
David Bremner,Erik D. Demaine,Jeff Erickson,John Iacono,Stefan Langerman,Pat Morin,Godfried G. Toussaint +6 more
TL;DR: Output-sensitive algorithms for computing this decision boundary for point sets on the line and in ℝ2 are developed, which is the best possible when parameterizing with respect to n and k.