A Search Engine for 3D Models, with Thomas Funkhouser, Patrick Min, Michael Kazhdan, Joyce Chen, Alex Halderman, and David Jacobs, to appear in ACM Transactions on Graphics, 2003.

A Reflective Symmetry Descriptor for 3D Models, with Michael Kazhdan, Bernard Chazelle, Thomas Funkhouser, and Szymon Rusinkiewicz, to appear in Algorithmica, 2002. Earlier version appeared at European Conference on Computer Vision (ECCV), May, 2002.

Shape Distributions, with Robert Osada, Thomas Funkhouser, and Bernard Chazelle. to appear in ACM Transactions on Graphics, October, 2002. earlier version appeared at Shape Modeling International, Genova, Italy, May, 2001.

Efficient and Small Representation of Line Arrangements with Applications with Ayelet Tal, Symposium on Computational Geometry, June, 2001, 293-301.

Multiresolution Mesh Morphing with Aaron W. F. Lee, Wim Sweldens, and Peter Schroder, SIGGRAPH '99, 343-350.
See for sample morphs

MAPS: Multiresolution Adaptive Parameterization of Surfaces with Aaron W. F. Lee, Wim Sweldens, Peter Schroder and Lawrence Cowsar, SIGGRAPH '98, 95-104. Wim's home page for the paper
US patent 6,285,372

Introduction to the Animation of Geometric Algorithms by Hausner and Dobkin in Handbook for Computational Geometry", edited by Sack and Urrutia, North Holland, 387--421, 1999. PDF is here and html version is here

Implementing a General Purpose Edge Router with Emden Gansner, Eleftherios Koutsofios and Stephen North, Graph Drawing '97, 262-271.

Visualizing Geometric Algorithms - State of the Art Strategic Directions in Computing Research, MIT, 1996

Computational Geometry -- Where Did It Come From, What is It, What is it Good For. Plenary Talk at SCG/WACG 1996. These are the transparencies from the talk. Please treat them as a draft of a more formal document to follow.
Pictures of me giving the talk thanks to Peter van Emde Boas

The Quickhull Algorithm for Convex Hulls by Barber, Dobkin, Huhdanpaa ACM TOMS, 1996, 469-483. The software described here is at http://www.geom.umn.edu/locate/qhull and the tables for the paper are here.

Strategies for Polyhedral Surface Decomposition:An Experimental Study by Chazelle, Dobkin, Shouraboura, Tal that appeared in ACM Symposium on Computational geometry, 1995 (this is the final journal version from Computational Geometry: Theory and Applications, 7(4-5): 327-342, 1997)

Concept Learning with Geometric Hypotheses by Dobkin, Gunopolos that appeared in Conference on Learning Theory '95

Computing the maximum bichromatic discrepancy with applications in computer graphics and machine learning, by Dobkin, Gunopolos, Maass JCSS, 52, 3, 1996, pp. 453-470.

Computer Graphics by D. Dobkin and S. Teller To appear in E. Goodman and J. O'Rourke, eds., CRC Handbook of Discrete and Computational Geometry CRC Press, 779-797, 1997.

Computing the Discrepancy with Applications to Supersampling Patterns by Dobkin, Eppstein, Mitchell ACM TOGS, Vol.15, No. 4 (Oct. 1996), pp. 354-376.
my PDF
their pdf

Visualization of Geometric Algorithms by Tal and Dobkin IEEE Transactions on Visualization and Computer Graphics volume 1, number 2, 1995.

Computing the intersection depth of polyhedra, by D. Dobkin, J. Hershberger, D. Kirkpatrick and S. Suri Algorithmica , vol. 9, no.6, 1993, pp. 518-533,

Computational Geometry and Computer Graphics by Dobkin Proceedings of the IEEE, vol 80, no 9, 1992, pp. 1400--1411.

Determining the separation of preprocessed polyhedra -- a unified approach, by D. Dobkin and D. Kirkpatrick ICALP-90, LNCS 443, 400-413, Springer Verlag, Berlin, 1990.

Maintenance of geometric extrema, by D. Dobkin and S. Suri JACM, vol. 38, 1991, pp. 275-298

Primitives for the manipulation of three-dimensional subdivisions, by D. Dobkin and M. Laszlo Algorithmica , vol. 4, no. 1, 1989, pp. 3-32.