|
Search the dblp DataBase
David Bremner:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Mark de Berg, Prosenjit Bose, David Bremner, William S. Evans, Lata Narayanan
Recovering lines with fixed linear probes. [Citation Graph (0, 0)][DBLP] CCCG, 1998, pp:- [Conf]
- Prosenjit Bose, David Bremner, Godfried T. Toussaint
All Convex Polyhedra can be Clamped with Parallel Jaw Grippers. [Citation Graph (0, 0)][DBLP] CCCG, 1994, pp:344-349 [Conf]
- David Bremner
Link-2-Convex One-Fillable Polygons are Starshaped. [Citation Graph (0, 0)][DBLP] CCCG, 1994, pp:363-368 [Conf]
- David Bremner, David Gay
Experimental lower bounds for three simplex chirality measures in low dimension. [Citation Graph (0, 0)][DBLP] CCCG, 2004, pp:170-173 [Conf]
- David Bremner, Victor Klee
Inner diagonals of convex polytopes. [Citation Graph (0, 0)][DBLP] CCCG, 1999, pp:- [Conf]
- Alexander Golynski, David Bremner
Sufficiently Fat Polyhedra are Not 2-Castable. [Citation Graph (0, 0)][DBLP] CCCG, 2003, pp:120-122 [Conf]
- David Avis, David Bremner
How Good are Convex Hull Algorithms? [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1995, pp:20-28 [Conf]
- Prosenjit Bose, David Bremner, Marc J. van Kreveld
Determining the Castability of Simple Polyhedra. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1994, pp:123-131 [Conf]
- David Bremner, Komei Fukuda, Ambros Marzetta
Primal-Dual Methods for Vertex and Facet Enumeration (Preliminary Version). [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1997, pp:49-56 [Conf]
- David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian
Necklaces, Convolutions, and X + Y. [Citation Graph (0, 0)][DBLP] ESA, 2006, pp:160-171 [Conf]
- David Bremner
Incremental Convex Hull Algorithms Are Not Output Sensitive. [Citation Graph (0, 0)][DBLP] ISAAC, 1996, pp:26-35 [Conf]
- David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristan
Small Convex Quadrangulations of Point Sets. [Citation Graph (0, 0)][DBLP] ISAAC, 2001, pp:623-635 [Conf]
- Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia
Playing with Triangulations. [Citation Graph (0, 0)][DBLP] JCDCG, 2002, pp:22-37 [Conf]
- Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong
Computing Constrained Minimum-Width Annuli of Point Sets. [Citation Graph (0, 0)][DBLP] WADS, 1997, pp:392-401 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] WADS, 2003, pp:451-461 [Conf]
- Prosenjit Bose, David Bremner, Marc J. van Kreveld
Determining the Castability of Simple Polyhedra. [Citation Graph (0, 0)][DBLP] Algorithmica, 1997, v:19, n:1/2, pp:84-113 [Journal]
- David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristan
Small Strictly Convex Quadrilateral Meshes of Point Sets. [Citation Graph (0, 0)][DBLP] Algorithmica, 2003, v:38, n:2, pp:317-339 [Journal]
- Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong
Computing constrained minimum-width annuli of point sets. [Citation Graph (0, 0)][DBLP] Computer-Aided Design, 1998, v:30, n:4, pp:267-275 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2003, v:25, n:1-2, pp:139-159 [Journal]
- Prosenjit Bose, David Bremner, Godfried T. Toussaint
All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1996, v:6, n:, pp:291-302 [Journal]
- David Bremner
Selected papers from the 12th Annual Canadian Conference on Computational Geometry - Editorial. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2001, v:20, n:1-2, pp:1- [Journal]
- Emo Welzl, David Avis, David Bremner, Raimund Seidel
How Good Are Convex Hull Algorithms?. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1997, v:7, n:, pp:265-301 [Journal]
- 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 [Citation Graph (0, 0)][DBLP] CoRR, 2002, v:0, n:, pp:- [Journal]
- David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristan
Small Strictly Convex Quadrilateral Meshes of Point Sets [Citation Graph (0, 0)][DBLP] CoRR, 2002, v:0, n:, pp:- [Journal]
- David Bremner, Alexander Golynski
Sufficiently Fat Polyhedra are not 2-castable [Citation Graph (0, 0)][DBLP] CoRR, 2002, v:0, n:, pp:- [Journal]
- David Bremner
Incremental Convex Hull Algorithms Are Not Output Sensitive. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1999, v:21, n:1, pp:57-68 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2005, v:33, n:4, pp:593-604 [Journal]
- David Bremner, Komei Fukuda, Ambros Marzetta
Primal - Dual Methods for Vertex and Facet Enumeration. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1998, v:20, n:3, pp:333-357 [Journal]
- David Bremner, Thomas C. Shermer
Point Visibility Graphs and O-Convex Cover. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2000, v:10, n:1, pp:55-71 [Journal]
- David Bremner, Victor Klee
Inner Diagonals of Convex Polytopes. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1999, v:87, n:1, pp:175-197 [Journal]
- Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia
Games on triangulations. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:343, n:1-2, pp:42-71 [Journal]
- Prosenjit Bose, David Bremner, Diane L. Souvaine
Computing the Tool Path of an Externally Monotone Polygon in Linear Time. [Citation Graph (0, 0)][DBLP] CCCG, 2006, pp:- [Conf]
- David Bremner, Mathieu Dutour Sikiric, Achill Schürmann
Polyhedral representation conversion up to symmetries [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
A note on alpha-drawable k-trees. [Citation Graph (, )][DBLP]
A Branch and Cut Algorithm for the Halfspace Depth Problem [Citation Graph (, )][DBLP]
Symmetric matroid polytopes and their generation. [Citation Graph (, )][DBLP]
Search in 0.065secs, Finished in 0.067secs
|