2008 |
36 | | Svetlana Stolpner,
Jonathan Lenchner,
Giuseppe Liotta,
David Bremner,
Christophe Paul,
Marc Pouget,
Stephen K. Wismath:
A note on alpha-drawable k-trees.
CCCG 2008 |
35 | EE | David Bremner,
Antoine Deza,
Michael Soltys:
Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms.
J. Comb. Optim. 16(4): 323 (2008) |
34 | EE | David Bremner,
Dan Chen,
John Iacono,
Stefan Langerman,
Pat Morin:
Output-sensitive algorithms for Tukey depth and related problems.
Statistics and Computing 18(3): 259-266 (2008) |
2007 |
33 | EE | David Bremner,
Mathieu Dutour Sikiric,
Achill Schürmann:
Polyhedral representation conversion up to symmetries
CoRR abs/math/0702239: (2007) |
2006 |
32 | EE | Prosenjit Bose,
David Bremner,
Diane L. Souvaine:
Computing the Tool Path of an Externally Monotone Polygon in Linear Time.
CCCG 2006 |
31 | EE | David Bremner,
Timothy M. Chan,
Erik D. Demaine,
Jeff Erickson,
Ferran Hurtado,
John Iacono,
Stefan Langerman,
Perouz Taslakian:
Necklaces, Convolutions, and X + Y.
ESA 2006: 160-171 |
2005 |
30 | EE | David Bremner,
Erik D. Demaine,
Jeff Erickson,
John Iacono,
Stefan Langerman,
Pat Morin,
Godfried T. Toussaint:
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.
Discrete & Computational Geometry 33(4): 593-604 (2005) |
29 | EE | Oswin Aichholzer,
David Bremner,
Erik D. Demaine,
Ferran Hurtado,
Evangelos Kranakis,
Hannes Krasser,
Suneeta Ramaswami,
Saurabh Sethia,
Jorge Urrutia:
Games on triangulations.
Theor. Comput. Sci. 343(1-2): 42-71 (2005) |
2004 |
28 | EE | David Bremner,
David Gay:
Experimental lower bounds for three simplex chirality measures in low dimension.
CCCG 2004: 170-173 |
2003 |
27 | | Alexander Golynski,
David Bremner:
Sufficiently Fat Polyhedra are Not 2-Castable.
CCCG 2003: 120-122 |
26 | EE | David Bremner,
Erik D. Demaine,
Jeff Erickson,
John Iacono,
Stefan Langerman,
Pat Morin,
Godfried T. Toussaint:
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.
WADS 2003: 451-461 |
25 | EE | David Bremner,
Ferran Hurtado,
Suneeta Ramaswami,
Vera Sacristan:
Small Strictly Convex Quadrilateral Meshes of Point Sets.
Algorithmica 38(2): 317-339 (2003) |
24 | | Oswin Aichholzer,
David Bremner,
Erik D. Demaine,
Henk Meijer,
Vera Sacristan,
Michael A. Soss:
Long proteins with unique optimal foldings in the H-P model.
Comput. Geom. 25(1-2): 139-159 (2003) |
2002 |
23 | EE | Oswin Aichholzer,
David Bremner,
Erik D. Demaine,
Ferran Hurtado,
Evangelos Kranakis,
Hannes Krasser,
Suneeta Ramaswami,
Saurabh Sethia,
Jorge Urrutia:
Playing with Triangulations.
JCDCG 2002: 22-37 |
22 | EE | Oswin Aichholzer,
David Bremner,
Erik D. Demaine,
Henk Meijer,
Vera Sacristan,
Michael A. Soss:
Long Proteins with Unique Optimal Foldings in the H-P Model
CoRR cs.CG/0201018: (2002) |
21 | EE | David Bremner,
Ferran Hurtado,
Suneeta Ramaswami,
Vera Sacristan:
Small Strictly Convex Quadrilateral Meshes of Point Sets
CoRR cs.CG/0202011: (2002) |
20 | EE | David Bremner,
Alexander Golynski:
Sufficiently Fat Polyhedra are not 2-castable
CoRR cs.CG/0203025: (2002) |
2001 |
19 | EE | David Bremner,
Ferran Hurtado,
Suneeta Ramaswami,
Vera Sacristan:
Small Convex Quadrangulations of Point Sets.
ISAAC 2001: 623-635 |
18 | | David Bremner:
Selected papers from the 12th Annual Canadian Conference on Computational Geometry - Editorial.
Comput. Geom. 20(1-2): 1 (2001) |
2000 |
17 | | David Bremner,
Thomas C. Shermer:
Point Visibility Graphs and O-Convex Cover.
Int. J. Comput. Geometry Appl. 10(1): 55-71 (2000) |
1999 |
16 | EE | David Bremner,
Victor Klee:
Inner diagonals of convex polytopes.
CCCG 1999 |
15 | EE | David Bremner:
Incremental Convex Hull Algorithms Are Not Output Sensitive.
Discrete & Computational Geometry 21(1): 57-68 (1999) |
14 | EE | David Bremner,
Victor Klee:
Inner Diagonals of Convex Polytopes.
J. Comb. Theory, Ser. A 87(1): 175-197 (1999) |
1998 |
13 | EE | Mark de Berg,
Prosenjit Bose,
David Bremner,
William S. Evans,
Lata Narayanan:
Recovering lines with fixed linear probes.
CCCG 1998 |
12 | EE | Mark de Berg,
Prosenjit Bose,
David Bremner,
Suneeta Ramaswami,
Gordon T. Wilfong:
Computing constrained minimum-width annuli of point sets.
Computer-Aided Design 30(4): 267-275 (1998) |
11 | EE | David Bremner,
Komei Fukuda,
Ambros Marzetta:
Primal - Dual Methods for Vertex and Facet Enumeration.
Discrete & Computational Geometry 20(3): 333-357 (1998) |
1997 |
10 | EE | David Bremner,
Komei Fukuda,
Ambros Marzetta:
Primal-Dual Methods for Vertex and Facet Enumeration (Preliminary Version).
Symposium on Computational Geometry 1997: 49-56 |
9 | | Mark de Berg,
Prosenjit Bose,
David Bremner,
Suneeta Ramaswami,
Gordon T. Wilfong:
Computing Constrained Minimum-Width Annuli of Point Sets.
WADS 1997: 392-401 |
8 | | Prosenjit Bose,
David Bremner,
Marc J. van Kreveld:
Determining the Castability of Simple Polyhedra.
Algorithmica 19(1/2): 84-113 (1997) |
7 | EE | David Avis,
David Bremner,
Raimund Seidel:
How Good Are Convex Hull Algorithms?.
Comput. Geom. 7: 265-301 (1997) |
1996 |
6 | | David Bremner:
Incremental Convex Hull Algorithms Are Not Output Sensitive.
ISAAC 1996: 26-35 |
5 | | Prosenjit Bose,
David Bremner,
Godfried T. Toussaint:
All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers.
Comput. Geom. 6: 291-302 (1996) |
1995 |
4 | EE | David Avis,
David Bremner:
How Good are Convex Hull Algorithms?
Symposium on Computational Geometry 1995: 20-28 |
1994 |
3 | | Prosenjit Bose,
David Bremner,
Godfried T. Toussaint:
All Convex Polyhedra can be Clamped with Parallel Jaw Grippers.
CCCG 1994: 344-349 |
2 | | David Bremner:
Link-2-Convex One-Fillable Polygons are Starshaped.
CCCG 1994: 363-368 |
1 | EE | Prosenjit Bose,
David Bremner,
Marc J. van Kreveld:
Determining the Castability of Simple Polyhedra.
Symposium on Computational Geometry 1994: 123-131 |