The quickhull algorithm for convex hulls. Zbl 0884.65145
Barber, C. Bradford; Dobkin, David P.; Huhdanpaa, Hannu |
|
1996
|
On sparse spanners of weighted graphs. Zbl 0762.05039
Althöfer, Ingo; Das, Gautam; Dobkin, David; Joseph, Deborah; Soares, José |
|
1993
|
Delaunay graphs are almost as good as complete graphs. Zbl 0693.05045
Dobkin, David P.; Friedman, Steven J.; Supowit, Kenneth J. |
|
1990
|
Shape distributions. Zbl 1331.68256
Osada, Robert; Funkhouser, Thomas A.; Chazelle, Bernard; Dobkin, David P. |
|
2002
|
Fast detection of polyhedral intersection. Zbl 0553.68033
Dobkin, David P.; Kirkpatrick, David G. |
|
1983
|
A linear algorithm for determining the separation of convex polyhedra. Zbl 0577.52004
Dobkin, David P.; Kirkpatrick, David G. |
|
1985
|
Multidimensional searching problems. Zbl 0333.68031
Dobkin, David; Lipton, Richard J. |
|
1976
|
On the complexity of computations under varying sets of primitives. Zbl 0409.68023
Dobkin, David P.; Lipton, Richard J. |
|
1979
|
Determining the separation of preprocessed polyhedra – A unified approach. Zbl 0765.68205
Dobkin, David P.; Kirkpatrick, David G. |
|
1990
|
On the optimal evaluation of a set of bilinear forms. Zbl 0376.68042
Brockett, Roger W.; Dobkin, David |
|
1978
|
Finding extremal polygons. Zbl 0557.68034
Boyce, James E.; Dobkin, David P.; Drysdale, Robert L. III; Guibas, Leo J. |
|
1985
|
Linear programming is log-space hard for P. Zbl 0402.68042
Dobkin, David; Lipton, Richard J.; Reiss, Steven |
|
1979
|
Optimal convex decompositions. Zbl 0609.68035
Chazelle, Bernard; Dobkin, David P. |
|
1985
|
Computational geometry in a curved world. Zbl 0696.68101
Dobkin, David P.; Souvaine, Diane L. |
|
1990
|
A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem. Zbl 0397.68045
Dobkin, David; Lipton, Richard J. |
|
1978
|
Primitives for the manipulation of three-dimensional subdivisions. Zbl 0664.68023
Dobkin, David P.; Laszlo, Michael J. |
|
1989
|
Computing the intersection-depth to polyhedra. Zbl 0797.68162
Dobkin, David; Hershberger, John; Kirkpatrick, David; Suri, Subhash |
|
1993
|
On the optimal evaluation of a set of bilinear forms. Zbl 0328.68045
Brockett, Roger W.; Dobkin, David |
|
1973
|
On the number of multiplications required for matrix multiplication. Zbl 0345.65011
Brockett, Roger W.; Dobkin, David |
|
1976
|
Partitioning space for range queries. Zbl 0675.68066
Yao, F. Frances; Dobkin, David P.; Edelsbrunner, Herbert; Paterson, Michael S. |
|
1989
|
Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning. Zbl 0858.68077
Dobkin, David P.; Gunopulos, Dimitrios; Maass, Wolfgang |
|
1996
|
Decomposition and intersection of simple splinegons. Zbl 0648.68062
Dobkin, David P.; Souvaine, Diane L.; Van Wyk, Christopher J. |
|
1988
|
Generating sparse spanners for weighted graphs. Zbl 1502.68198
Althöfer, Ingo; Das, Gautam; Dobkin, David; Joseph, Deborah |
|
1990
|
The complexity of linear programming. Zbl 0446.90049
Dobkin, David P.; Reiss, Steven P. |
|
1980
|
Space searching for intersecting objects. Zbl 0646.68077
Dobkin, David P.; Edelsbrunner, Herbert |
|
1987
|
Strategies for polyhedral surface decomposition: an experimental study. Zbl 1133.52305
Chazelle, Bernard; Dobkin, David P.; Shouraboura, Nadia; Tal, Ayellet |
|
1997
|
Searching for empty convex polygons. Zbl 0697.68034
Dobkin, David P.; Edelsbrunner, Herbert; Overmars, Mark H. |
|
1990
|
Inclusion complete tally languages and the Hartmanis-Berman conjecture. Zbl 0365.68044
Book, Ronald V.; Wrathall, Celia; Selman, Alan L.; Dobkin, David |
|
1977
|
Space searching for intersecting objects. Zbl 0643.68051
Dobkin, David P.; Edelsbrunner, Herbert |
|
1987
|
A reflective symmetry descriptor for 3D models. Zbl 1072.68095
Kazhdan, Michael; Chazelle, Bernard; Dobkin, David; Funkhouser, Thomas; Rusinkiewicz, Szymon |
|
2004
|
An efficient algorithm for finding the CSG representation of a simple polygon. Zbl 0777.68076
Dobkin, David; Guibas, Leonidas; Hershberger, John; Snoeyink, Jack |
|
1993
|
An improved lower bound on polynomial multiplication. Zbl 0431.68052
Brown, Mark R.; Dobkin, David P. |
|
1980
|
Maintenance of geometric extrema. Zbl 0799.68106
Dobkin, David; Suri, Subhash |
|
1991
|
On the complexity of computations under varying sets of primitives. Zbl 0318.68034
Dobkin, David P.; Lipton, Richard J. |
|
1975
|
Visibility with a moving point of view. Zbl 0804.68147
Bern, Marshall; Dobkin, David; Eppstein, David; Grossman, Robert |
|
1994
|
Triangulating polygons without large angles. Zbl 0818.68139
Bern, Marshall; Dobkin, David; Eppstein, David |
|
1995
|
Determining the mode. Zbl 0441.68048
Dobkin, David; Munro, J. Ian |
|
1980
|
Fast detection of polyhedral intersections. Zbl 0494.68056
Dobkin, David P.; Kirkpatrick, David G. |
|
1982
|
A reflective symmetry descriptor. Zbl 1039.68663
Kazhdan, M.; Chazelle, B.; Dobkin, D.; Finkelstein, A.; Funkhouser, T. |
|
2002
|
Addition chain methods for the evaluation of specific polynomials. Zbl 0447.68034
Dobkin, David; Lipton, Richard J. |
|
1980
|
A nonlinear lower bound on linear search tree programs for solving knapsack-problems. Zbl 0338.68041
Dobkin, David |
|
1976
|
Optimal time minimal space selection algorithms. Zbl 0461.68061
Dobkin, David; Munro, J. Ian |
|
1981
|
Detecting the intersection of convex objects in the plane. Zbl 0743.65109
Dobkin, David P.; Souvaine, Diane L. |
|
1991
|
On some generalizations of binary search. Zbl 0361.68063
Dobkin, David; Lipton, R. J. |
|
1974
|
Visibility with a moving point of view. Zbl 0800.68975
Bern, Marshall; Dobkin, David; Eppstein, David; Grossmann, Robert |
|
1990
|
A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem. Zbl 0362.68077
Dobkin, David; Lipton, Richard J. |
|
1976
|
Complexity measures and hierarchies for the evaluation of integers and polynomials. Zbl 0365.68049
Lipton, Richard J.; Dobkin, David |
|
1977
|
Aspects of the database security problem. Zbl 0456.68133
Dobkin, David; Lipton, Richard J.; Reiss, Steven P. |
|
1977
|
Foundations of secure computation. Papers presented at a 3 day workshop held at Georgia Institute of Technology, Atlanta, October 1977. Zbl 0431.68085
|
|
1978
|
The complexity of vector-products. Zbl 0369.68029
Dobkin, David; Van Leeuwen, Jan |
|
1976
|
Time and space bounds for selection problems. Zbl 0382.68048
Dobkin, David; Munro, J. Ian |
|
1978
|
Efficient uses of the past. Zbl 0584.68100
Dobkin, David P.; Munro, J. Ian |
|
1985
|
Addition chain methods for the evaluation of specific polynomials. Zbl 0408.68042
Dobkin, David; Lipton, Richard |
|
1977
|
Computer graphics. Zbl 0907.68200
Dobkin, David; Teller, Seth |
|
1997
|
Applied computational geometry: Towards robust solutions of basic problems. Zbl 0702.68097
Dobkin, David; Silver, Deborah |
|
1990
|
Efficient and small representation of line arrangements with applications. Zbl 1374.68662
Dobkin, David P.; Tal, Ayellet |
|
2001
|
Geometric problems in machine learning. Zbl 1541.68315
Dobkin, David; Gunopulos, Dimitrios |
|
1996
|
A reflective symmetry descriptor for 3D models. Zbl 1072.68095
Kazhdan, Michael; Chazelle, Bernard; Dobkin, David; Funkhouser, Thomas; Rusinkiewicz, Szymon |
|
2004
|
Shape distributions. Zbl 1331.68256
Osada, Robert; Funkhouser, Thomas A.; Chazelle, Bernard; Dobkin, David P. |
|
2002
|
A reflective symmetry descriptor. Zbl 1039.68663
Kazhdan, M.; Chazelle, B.; Dobkin, D.; Finkelstein, A.; Funkhouser, T. |
|
2002
|
Efficient and small representation of line arrangements with applications. Zbl 1374.68662
Dobkin, David P.; Tal, Ayellet |
|
2001
|
Strategies for polyhedral surface decomposition: an experimental study. Zbl 1133.52305
Chazelle, Bernard; Dobkin, David P.; Shouraboura, Nadia; Tal, Ayellet |
|
1997
|
Computer graphics. Zbl 0907.68200
Dobkin, David; Teller, Seth |
|
1997
|
The quickhull algorithm for convex hulls. Zbl 0884.65145
Barber, C. Bradford; Dobkin, David P.; Huhdanpaa, Hannu |
|
1996
|
Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning. Zbl 0858.68077
Dobkin, David P.; Gunopulos, Dimitrios; Maass, Wolfgang |
|
1996
|
Geometric problems in machine learning. Zbl 1541.68315
Dobkin, David; Gunopulos, Dimitrios |
|
1996
|
Triangulating polygons without large angles. Zbl 0818.68139
Bern, Marshall; Dobkin, David; Eppstein, David |
|
1995
|
Visibility with a moving point of view. Zbl 0804.68147
Bern, Marshall; Dobkin, David; Eppstein, David; Grossman, Robert |
|
1994
|
On sparse spanners of weighted graphs. Zbl 0762.05039
Althöfer, Ingo; Das, Gautam; Dobkin, David; Joseph, Deborah; Soares, José |
|
1993
|
Computing the intersection-depth to polyhedra. Zbl 0797.68162
Dobkin, David; Hershberger, John; Kirkpatrick, David; Suri, Subhash |
|
1993
|
An efficient algorithm for finding the CSG representation of a simple polygon. Zbl 0777.68076
Dobkin, David; Guibas, Leonidas; Hershberger, John; Snoeyink, Jack |
|
1993
|
Maintenance of geometric extrema. Zbl 0799.68106
Dobkin, David; Suri, Subhash |
|
1991
|
Detecting the intersection of convex objects in the plane. Zbl 0743.65109
Dobkin, David P.; Souvaine, Diane L. |
|
1991
|
Delaunay graphs are almost as good as complete graphs. Zbl 0693.05045
Dobkin, David P.; Friedman, Steven J.; Supowit, Kenneth J. |
|
1990
|
Determining the separation of preprocessed polyhedra – A unified approach. Zbl 0765.68205
Dobkin, David P.; Kirkpatrick, David G. |
|
1990
|
Computational geometry in a curved world. Zbl 0696.68101
Dobkin, David P.; Souvaine, Diane L. |
|
1990
|
Generating sparse spanners for weighted graphs. Zbl 1502.68198
Althöfer, Ingo; Das, Gautam; Dobkin, David; Joseph, Deborah |
|
1990
|
Searching for empty convex polygons. Zbl 0697.68034
Dobkin, David P.; Edelsbrunner, Herbert; Overmars, Mark H. |
|
1990
|
Visibility with a moving point of view. Zbl 0800.68975
Bern, Marshall; Dobkin, David; Eppstein, David; Grossmann, Robert |
|
1990
|
Applied computational geometry: Towards robust solutions of basic problems. Zbl 0702.68097
Dobkin, David; Silver, Deborah |
|
1990
|
Primitives for the manipulation of three-dimensional subdivisions. Zbl 0664.68023
Dobkin, David P.; Laszlo, Michael J. |
|
1989
|
Partitioning space for range queries. Zbl 0675.68066
Yao, F. Frances; Dobkin, David P.; Edelsbrunner, Herbert; Paterson, Michael S. |
|
1989
|
Decomposition and intersection of simple splinegons. Zbl 0648.68062
Dobkin, David P.; Souvaine, Diane L.; Van Wyk, Christopher J. |
|
1988
|
Space searching for intersecting objects. Zbl 0646.68077
Dobkin, David P.; Edelsbrunner, Herbert |
|
1987
|
Space searching for intersecting objects. Zbl 0643.68051
Dobkin, David P.; Edelsbrunner, Herbert |
|
1987
|
A linear algorithm for determining the separation of convex polyhedra. Zbl 0577.52004
Dobkin, David P.; Kirkpatrick, David G. |
|
1985
|
Finding extremal polygons. Zbl 0557.68034
Boyce, James E.; Dobkin, David P.; Drysdale, Robert L. III; Guibas, Leo J. |
|
1985
|
Optimal convex decompositions. Zbl 0609.68035
Chazelle, Bernard; Dobkin, David P. |
|
1985
|
Efficient uses of the past. Zbl 0584.68100
Dobkin, David P.; Munro, J. Ian |
|
1985
|
Fast detection of polyhedral intersection. Zbl 0553.68033
Dobkin, David P.; Kirkpatrick, David G. |
|
1983
|
Fast detection of polyhedral intersections. Zbl 0494.68056
Dobkin, David P.; Kirkpatrick, David G. |
|
1982
|
Optimal time minimal space selection algorithms. Zbl 0461.68061
Dobkin, David; Munro, J. Ian |
|
1981
|
The complexity of linear programming. Zbl 0446.90049
Dobkin, David P.; Reiss, Steven P. |
|
1980
|
An improved lower bound on polynomial multiplication. Zbl 0431.68052
Brown, Mark R.; Dobkin, David P. |
|
1980
|
Determining the mode. Zbl 0441.68048
Dobkin, David; Munro, J. Ian |
|
1980
|
Addition chain methods for the evaluation of specific polynomials. Zbl 0447.68034
Dobkin, David; Lipton, Richard J. |
|
1980
|
On the complexity of computations under varying sets of primitives. Zbl 0409.68023
Dobkin, David P.; Lipton, Richard J. |
|
1979
|
Linear programming is log-space hard for P. Zbl 0402.68042
Dobkin, David; Lipton, Richard J.; Reiss, Steven |
|
1979
|
On the optimal evaluation of a set of bilinear forms. Zbl 0376.68042
Brockett, Roger W.; Dobkin, David |
|
1978
|
A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem. Zbl 0397.68045
Dobkin, David; Lipton, Richard J. |
|
1978
|
Foundations of secure computation. Papers presented at a 3 day workshop held at Georgia Institute of Technology, Atlanta, October 1977. Zbl 0431.68085
|
|
1978
|
Time and space bounds for selection problems. Zbl 0382.68048
Dobkin, David; Munro, J. Ian |
|
1978
|
Inclusion complete tally languages and the Hartmanis-Berman conjecture. Zbl 0365.68044
Book, Ronald V.; Wrathall, Celia; Selman, Alan L.; Dobkin, David |
|
1977
|
Complexity measures and hierarchies for the evaluation of integers and polynomials. Zbl 0365.68049
Lipton, Richard J.; Dobkin, David |
|
1977
|
Aspects of the database security problem. Zbl 0456.68133
Dobkin, David; Lipton, Richard J.; Reiss, Steven P. |
|
1977
|
Addition chain methods for the evaluation of specific polynomials. Zbl 0408.68042
Dobkin, David; Lipton, Richard |
|
1977
|
Multidimensional searching problems. Zbl 0333.68031
Dobkin, David; Lipton, Richard J. |
|
1976
|
On the number of multiplications required for matrix multiplication. Zbl 0345.65011
Brockett, Roger W.; Dobkin, David |
|
1976
|
A nonlinear lower bound on linear search tree programs for solving knapsack-problems. Zbl 0338.68041
Dobkin, David |
|
1976
|
A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem. Zbl 0362.68077
Dobkin, David; Lipton, Richard J. |
|
1976
|
The complexity of vector-products. Zbl 0369.68029
Dobkin, David; Van Leeuwen, Jan |
|
1976
|
On the complexity of computations under varying sets of primitives. Zbl 0318.68034
Dobkin, David P.; Lipton, Richard J. |
|
1975
|
On some generalizations of binary search. Zbl 0361.68063
Dobkin, David; Lipton, R. J. |
|
1974
|
On the optimal evaluation of a set of bilinear forms. Zbl 0328.68045
Brockett, Roger W.; Dobkin, David |
|
1973
|