David P. Dobkin

According to our database, David P. Dobkin authored at least 97 papers between 1973 and 2011.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of three.

2011

Learning how to match fresco fragments.

Thomas A. Funkhouser, Hijung Shin, Corey Toler-Franklin, Antonio García Castañeda, Benedict J. Brown, David P. Dobkin, Szymon Rusinkiewicz, Tim Weyrich

ACM Journal on Computing and Cultural Heritage, 2011

2008

A system for high-volume acquisition and matching of fresco fragments: reassembling Theran wall paintings.

Benedict J. Brown, Corey Toler-Franklin, Diego Nehab, Michael Burns, David P. Dobkin, Andreas Vlachopoulos, Christos Doumas, Szymon Rusinkiewicz, Tim Weyrich

ACM Trans. Graph., 2008

2006

Temporal Coherence in Bounding Volume Hierarchies for Collision Detection.

Oren Tropp, Ayellet Tal, Ilan Shimshoni, David P. Dobkin

Int. J. Shape Model., 2006

2004

Computer graphics.

David P. Dobkin, Seth J. Teller

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Modeling by example.

Thomas A. Funkhouser, Michael M. Kazhdan, Philip Shilane, Patrick Min, William Kiefer, Ayellet Tal, Szymon Rusinkiewicz, David P. Dobkin

ACM Trans. Graph., 2004

A Reflective Symmetry Descriptor for 3D Models.

Michael M. Kazhdan, Bernard Chazelle, David P. Dobkin, Thomas A. Funkhouser, Szymon Rusinkiewicz

Algorithmica, 2004

2003

A search engine for 3D models.

Thomas A. Funkhouser, Patrick Min, Michael M. Kazhdan, Joyce Chen, J. Alex Halderman, David P. Dobkin, David Pokrass Jacobs

ACM Trans. Graph., 2003

2002

Shape distributions.

Robert Osada, Thomas A. Funkhouser, Bernard Chazelle, David P. Dobkin

ACM Trans. Graph., 2002

A Reflective Symmetry Descriptor.

Michael M. Kazhdan, Bernard Chazelle, David P. Dobkin, Adam Finkelstein, Thomas A. Funkhouser

Proceedings of the Computer Vision, 2002

2001

Matching 3D Models with Shape Distributions.

Robert Osada, Thomas A. Funkhouser, Bernard Chazelle, David P. Dobkin

Proceedings of the 2001 International Conference on Shape Modeling and Applications (SMI 2001), 2001

Small representation of line arrangements.

David P. Dobkin, Ayellet Tal

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

Efficient and small representation of line arrangements with applications.

David P. Dobkin, Ayellet Tal

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2000

Making Geometry Visible: An Introduction to the Animation of Geometric Algorithms.

Alejo Hausner, David P. Dobkin

Proceedings of the Handbook of Computational Geometry, 2000

1999

Emerging Challenges in Computational Topology

Marshall W. Bern, David Eppstein, Pankaj K. Agarwal, Nina Amenta, L. Paul Chew, Tamal K. Dey, David P. Dobkin, Herbert Edelsbrunner, Cindy Grimm, Leonidas J. Guibas, John Harer, Joel Hass, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, Denis Zorin

CoRR, 1999

Multiresolution Mesh Morphing.

Aaron W. F. Lee, David P. Dobkin, Wim Sweldens, Peter Schröder

Proceedings of the 26th Annual Conference on Computer Graphics and Interactive Techniques, 1999

Uncluttering Force-Directed Graph Layouts.

David P. Dobkin, Alejo Hausner, Emden R. Gansner, Stephen C. North

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998

MAPS: Multiresolution Adaptive Parameterization of Surfaces.

Aaron W. F. Lee, Wim Sweldens, Peter Schröder, Lawrence C. Cowsar, David P. Dobkin

Proceedings of the 25th Annual Conference on Computer Graphics and Interactive Techniques, 1998

GAWAIN: Visualizing Geometric Algorithms with Web-Based Animation.

Alejo Hausner, David P. Dobkin

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

A Path Router for Graph Drawing.

David P. Dobkin, Emden R. Gansner

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997

Strategies for Polyhedral Surface Decomposition: an Experimental Study.

Bernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal

Comput. Geom., 1997

Applied Computational Geormetry - Abstract.

David P. Dobkin

Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Implementing a General-Purpose Edge Router.

David P. Dobkin, Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North

Proceedings of the Graph Drawing, 5th International Symposium, 1997

1996

The Quickhull Algorithm for Convex Hulls.

C. Bradford Barber, David P. Dobkin, Hannu Huhdanpaa

ACM Trans. Math. Softw., 1996

Computing the Discrepancy with Applications to Supersampling Patterns.

David P. Dobkin, David Eppstein, Don P. Mitchell

ACM Trans. Graph., 1996

Computing the Maximum Bichromatic Discrepancy with Applications to Computer Graphics and Machine Learning.

David P. Dobkin, Dimitrios Gunopulos, Wolfgang Maass

J. Comput. Syst. Sci., 1996

Geometric Problems in Machine Learning.

David P. Dobkin, Dimitrios Gunopulos

Proceedings of the Applied Computational Geormetry, 1996

Visualizing Geometric Algorithms - State of the Art.

David P. Dobkin

Proceedings of the Applied Computational Geormetry, 1996

1995

Visualization of Geometric Algorithms.

Ayellet Tal, David P. Dobkin

IEEE Trans. Vis. Comput. Graph., 1995

Triangulating polygons without large angles.

Marshall W. Bern, David P. Dobkin, David Eppstein

Int. J. Comput. Geom. Appl., 1995

Convex Surface Decomposition.

Bernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

Concept Learning with Geometric Hypotheses.

David P. Dobkin, Dimitrios Gunopulos

Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

1994

Visibility with a Moving Point of View.

Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman

Algorithmica, 1994

GASP - A System for Visualizing Geometric Algorithms.

Ayellet Tal, David P. Dobkin

Proceedings of the 5th IEEE Visualization Conference, 1994

GASP: A System to Facilitate Animating Geometric Algorithms.

Ayellet Tal, David P. Dobkin

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Computing the Rectangle Discrepancy.

David P. Dobkin, Dimitrios Gunopulos

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

GASP - An Animation System for Computational Geometry.

David P. Dobkin, Ayellet Tal

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

On Sparse Spanners of Weighted Graphs.

Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph, José Soares

Discret. Comput. Geom., 1993

Computing the Intersection-Depth of Polyhedra.

David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri

Algorithmica, 1993

An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon.

David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink

Algorithmica, 1993

Building and Using Polyhedral Hierarchies.

David P. Dobkin, Ayellet Tal

Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

Computing the Discrepancy.

David P. Dobkin, David Eppstein

Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1992

Computational geometry and computer graphics.

David P. Dobkin

Proc. IEEE, 1992

1991

Maintenance of Geometric Extrema.

David P. Dobkin, Subhash Suri

J. ACM, 1991

Detecting the intersection of convex objects in the plane.

David P. Dobkin, Diane L. Souvaine

Comput. Aided Geom. Des., 1991

1990

Contour tracing by piecewise linear approximations.

David P. Dobkin, Allan R. Wilks, Silvio V. F. Levy, William P. Thurston

ACM Trans. Graph., 1990

Applied Computational Geometry: Towards Robust Solutions of Basic Problems.

David P. Dobkin, Deborah Silver

J. Comput. Syst. Sci., 1990

Delaunay Graphs are almost as Good as Complete Graphs.

David P. Dobkin, Steven J. Friedman, Kenneth J. Supowit

Discret. Comput. Geom., 1990

Computational Geometry in a Curved World.

David P. Dobkin, Diane L. Souvaine

Algorithmica, 1990

Searching for Empty Convex Polygons.

David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars

Algorithmica, 1990

A Numerical Method for Rendering Spherical Reflections.

David P. Dobkin, E. S. Panduranga, M. Zhu

Proceedings of the 1st IEEE Visualization Conference, 1990

Generating Sparse Spanners for Weighted Graphs.

Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph

Proceedings of the SWAT 90, 1990

Implicitly Searching Convolutions and Computing Depth of Collision.

David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri

Proceedings of the Algorithms, 1990

A viewer for mathematical structures and surfaces in 3D.

David P. Dobkin, Stephen C. North, Nathaniel J. Thurston

Proceedings of the 1990 symposium on Interactive 3D graphics, 1990

Determining the Separation of Preprocessed Polyhedra - A Unified Approach.

David P. Dobkin, David G. Kirkpatrick

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

Probing Convex Polytopes.

David P. Dobkin, Herbert Edelsbrunner, Chee K. Yap

Proceedings of the Autonomous Robot Vehicles, 1990

1989

Partitioning Space for Range Queries.

F. Frances Yao, David P. Dobkin, Herbert Edelsbrunner, Mike Paterson

SIAM J. Comput., 1989

Primitives for the Manipulation of Three-Dimensional Subdivisions.

David P. Dobkin, Michael J. Laszlo

Algorithmica, 1989

Dynamically Computing the Maxima of Decomposable Functions, with Applications

David P. Dobkin, Subhash Suri

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988

Decomposition and Intersection of Simple Splinegons.

David P. Dobkin, Diane L. Souvaine, Christopher J. Van Wyk

Algorithmica, 1988

A library for incremental update of bitmap images.

David P. Dobkin, Eleftherios Koutsofios, Rob Pike

Proceedings of the ACM conference on Document processing systems, 1988

Recipes for Geometry and Numerical Analysis - Part I: An Empirical Study.

David P. Dobkin, Deborah Silver

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987

Space Searching for Intersecting Objects.

David P. Dobkin, Herbert Edelsbrunner

J. Algorithms, 1987

Intersection of convex objects in two and three dimensions.

Bernard Chazelle, David P. Dobkin

J. ACM, 1987

1986

Probing Convex Polytopes

David P. Dobkin, Herbert Edelsbrunner, Chee-Keng Yap

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985

Finding Extremal Polygons.

James E. Boyce, David P. Dobkin, Robert L. (Scot) Drysdale III, Leonidas J. Guibas

SIAM J. Comput., 1985

Efficient Uses of the Past.

David P. Dobkin, J. Ian Munro

J. Algorithms, 1985

A Linear Algorithm for Determining the Separation of Convex Polyhedra.

David P. Dobkin, David G. Kirkpatrick

J. Algorithms, 1985

1983

Fast Detection of Polyhedral Intersection.

David P. Dobkin, David G. Kirkpatrick

Theor. Comput. Sci., 1983

1982

Distributed Allocation with Pools of Servers.

Gregory R. Andrews, David P. Dobkin, Peter J. Downey

Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982

Fast Detection of Polyhedral Intersections.

David P. Dobkin, David G. Kirkpatrick

Proceedings of the Automata, 1982

1981

Optimal Time Minimal Space Selection Algorithms.

David P. Dobkin, J. Ian Munro

J. ACM, 1981

Active Data Structures.

Gregory R. Andrews, David P. Dobkin, Peter J. Downey

Proceedings of the 5th International Conference on Software Engineering, 1981

1980

The Complexity of Linear Programming.

David P. Dobkin, Steven P. Reiss

Theor. Comput. Sci., 1980

Determining the Mode.

David P. Dobkin, J. Ian Munro

Theor. Comput. Sci., 1980

An Improved Lower Bound on Polynomial Multiplication.

Mark R. Brown, David P. Dobkin

IEEE Trans. Computers, 1980

Addition Chain Methods for the Evaluation of Specific Polynomials.

David P. Dobkin, Richard J. Lipton

SIAM J. Comput., 1980

Detection is Easier than Computation (Extended Abstract)

Bernard Chazelle, David P. Dobkin

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1979

Secure Databases: Protection Against User Influence.

David P. Dobkin, Anita K. Jones, Richard J. Lipton

ACM Trans. Database Syst., 1979

On the Complexity of Computations under Varying Sets of Primitives.

David P. Dobkin, Richard J. Lipton

J. Comput. Syst. Sci., 1979

Linear Programming is Log-Space Hard for P.

David P. Dobkin, Richard J. Lipton, Steven P. Reiss

Inf. Process. Lett., 1979

Decomposing a Polygon into its Convex Parts

Bernard Chazelle, David P. Dobkin

Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

On a General Method for Maximizing and Minimizing among Certain Geometric Problems (Extended Abstract)

David P. Dobkin, Lawrence Snyder

Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978

Even Data Bases That Lie Can Be Compromised.

Richard A. DeMillo, David P. Dobkin, Richard J. Lipton

IEEE Trans. Software Eng., 1978

Errata: On the Number of Multiplications Required for Matrix Multiplication.

Roger W. Brockett, David P. Dobkin

SIAM J. Comput., 1978

A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem.

David P. Dobkin, Richard J. Lipton

J. Comput. Syst. Sci., 1978

Time and Space Bounds for Selection Problems.

David P. Dobkin, J. Ian Munro

Proceedings of the Automata, 1978

Recent progress in secure computation.

Richard A. DeMillo, David P. Dobkin

Proceedings of the IEEE Computer Society's Second International Computer Software and Applications Conference, 1978

1977

Inclusion Complete Tally Languages and the Hartmanis-Berman Conjecture.

Ronald V. Book, Celia Wrathall, Alan L. Selman, David P. Dobkin

Math. Syst. Theory, 1977

1976

Complexity Measures and Hierarchies for the Evaluation of Integers and Polynomials.

Richard J. Lipton, David P. Dobkin

Theor. Comput. Sci., 1976

Multidimensional Searching Problems.

David P. Dobkin, Richard J. Lipton

SIAM J. Comput., 1976

On the Number of Multiplications Required for Matrix Multiplication.

Roger W. Brockett, David P. Dobkin

SIAM J. Comput., 1976

A Nonlinear Lower Bound on Linear Search Tree Programs for Solving Knapsack Problems.

David P. Dobkin

J. Comput. Syst. Sci., 1976

The Complexity of Vector-Products.

David P. Dobkin, Jan van Leeuwen

Inf. Process. Lett., 1976

1975

Complexity Measures and Hierarchies for the Evaluation of Integers, Polynomials, and n-linear Forms

Richard J. Lipton, David P. Dobkin

Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

1974

On Some Generalizations of Binary Search

David P. Dobkin, Richard J. Lipton

Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

1973

On the Optimal Evaluation of a Set of Bilinear Forms

Roger W. Brockett, David P. Dobkin

Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30, 1973

On the Optimal Evaluation of a Set of n-Linear Forms

David P. Dobkin

Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973