David P. Dobkin

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

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 1997, "For pionering the development of computational geometry as a field, and for leading the technology transfer of theoretical algorithms to practical problems in computer graphics.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2011
Learning how to match fresco fragments.
JOCCH, 2011

2008
A system for high-volume acquisition and matching of fresco fragments: reassembling Theran wall paintings.
ACM Trans. Graph., 2008

2006
Temporal Coherence in Bounding Volume Hierarchies for Collision Detection.
Int. J. Shape Model., 2006

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

Modeling by example.
ACM Trans. Graph., 2004

A Reflective Symmetry Descriptor for 3D Models.
Algorithmica, 2004

2003
A search engine for 3D models.
ACM Trans. Graph., 2003

2002
Shape distributions.
ACM Trans. Graph., 2002

A Reflective Symmetry Descriptor.
Proceedings of the Computer Vision, 2002

2001
Matching 3D Models with Shape Distributions.
Proceedings of the 2001 International Conference on Shape Modeling and Applications (SMI 2001), 2001

Small representation of line arrangements.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

Efficient and small representation of line arrangements with applications.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2000
Making Geometry Visible: An Introduction to the Animation of Geometric Algorithms.
Proceedings of the Handbook of Computational Geometry, 2000

1999
Emerging Challenges in Computational Topology
CoRR, 1999

Multiresolution Mesh Morphing.
Proceedings of the 26th Annual Conference on Computer Graphics and Interactive Techniques, 1999

Uncluttering Force-Directed Graph Layouts.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998
MAPS: Multiresolution Adaptive Parameterization of Surfaces.
Proceedings of the 25th Annual Conference on Computer Graphics and Interactive Techniques, 1998

GAWAIN: Visualizing Geometric Algorithms with Web-Based Animation.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

A Path Router for Graph Drawing.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997
Strategies for Polyhedral Surface Decomposition: an Experimental Study.
Comput. Geom., 1997

Applied Computational Geormetry - Abstract.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Implementing a General-Purpose Edge Router.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

1996
The Quickhull Algorithm for Convex Hulls.
ACM Trans. Math. Softw., 1996

Computing the Discrepancy with Applications to Supersampling Patterns.
ACM Trans. Graph., 1996

Computing the Maximum Bichromatic Discrepancy with Applications to Computer Graphics and Machine Learning.
J. Comput. Syst. Sci., 1996

Geometric Problems in Machine Learning.
Proceedings of the Applied Computational Geormetry, 1996

Visualizing Geometric Algorithms - State of the Art.
Proceedings of the Applied Computational Geormetry, 1996

1995
Visualization of Geometric Algorithms.
IEEE Trans. Vis. Comput. Graph., 1995

Triangulating polygons without large angles.
Int. J. Comput. Geom. Appl., 1995

Convex Surface Decomposition.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

Concept Learning with Geometric Hypotheses.
Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

1994
Visibility with a Moving Point of View.
Algorithmica, 1994

GASP - A System for Visualizing Geometric Algorithms.
Proceedings of the Proceedings IEEE Visualization '94, 1994

GASP: A System to Facilitate Animating Geometric Algorithms.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Computing the Rectangle Discrepancy.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

GASP - An Animation System for Computational Geometry.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993
On Sparse Spanners of Weighted Graphs.
Discret. Comput. Geom., 1993

Computing the Intersection-Depth of Polyhedra.
Algorithmica, 1993

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

Building and Using Polyhedral Hierarchies.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

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

1991
Maintenance of Geometric Extrema.
J. ACM, 1991

Detecting the intersection of convex objects in the plane.
Comput. Aided Geom. Des., 1991

1990
Contour tracing by piecewise linear approximations.
ACM Trans. Graph., 1990

Applied Computational Geometry: Towards Robust Solutions of Basic Problems.
J. Comput. Syst. Sci., 1990

Delaunay Graphs are almost as Good as Complete Graphs.
Discret. Comput. Geom., 1990

Computational Geometry in a Curved World.
Algorithmica, 1990

Searching for Empty Convex Polygons.
Algorithmica, 1990

A Numerical Method for Rendering Spherical Reflections.
Proceedings of the Proceedings IEEE Visualization '90, 1990

Generating Sparse Spanners for Weighted Graphs.
Proceedings of the SWAT 90, 1990

Implicitly Searching Convolutions and Computing Depth of Collision.
Proceedings of the Algorithms, 1990

A viewer for mathematical structures and surfaces in 3D.
Proceedings of the 1990 symposium on Interactive 3D graphics, 1990

Determining the Separation of Preprocessed Polyhedra - A Unified Approach.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

Probing Convex Polytopes.
Proceedings of the Autonomous Robot Vehicles, 1990

1989
Partitioning Space for Range Queries.
SIAM J. Comput., 1989

Primitives for the Manipulation of Three-Dimensional Subdivisions.
Algorithmica, 1989

Dynamically Computing the Maxima of Decomposable Functions, with Applications
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.
Algorithmica, 1988

Recipes for Geometry and Numerical Analysis - Part I: An Empirical Study.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987
Space Searching for Intersecting Objects.
J. Algorithms, 1987

Intersection of convex objects in two and three dimensions.
J. ACM, 1987

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

1985
Finding Extremal Polygons.
SIAM J. Comput., 1985

Efficient Uses of the Past.
J. Algorithms, 1985

A Linear Algorithm for Determining the Separation of Convex Polyhedra.
J. Algorithms, 1985

1983
Fast Detection of Polyhedral Intersection.
Theor. Comput. Sci., 1983

1982
Distributed Allocation with Pools of Servers.
Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982

Fast Detection of Polyhedral Intersections.
Proceedings of the Automata, 1982

1981
Optimal Time Minimal Space Selection Algorithms.
J. ACM, 1981

Active Data Structures.
Proceedings of the 5th International Conference on Software Engineering, 1981

1980
The Complexity of Linear Programming.
Theor. Comput. Sci., 1980

Determining the Mode.
Theor. Comput. Sci., 1980

An Improved Lower Bound on Polynomial Multiplication.
IEEE Trans. Computers, 1980

Addition Chain Methods for the Evaluation of Specific Polynomials.
SIAM J. Comput., 1980

Detection is Easier than Computation (Extended Abstract)
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1979
Secure Databases: Protection Against User Influence.
ACM Trans. Database Syst., 1979

On the Complexity of Computations under Varying Sets of Primitives.
J. Comput. Syst. Sci., 1979

Linear Programming is Log-Space Hard for P.
Inf. Process. Lett., 1979

Decomposing a Polygon into its Convex Parts
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)
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978
Even Data Bases That Lie Can Be Compromised.
IEEE Trans. Software Eng., 1978

Errata: On the Number of Multiplications Required for Matrix Multiplication.
SIAM J. Comput., 1978

A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem.
J. Comput. Syst. Sci., 1978

Time and Space Bounds for Selection Problems.
Proceedings of the Automata, 1978

Recent progress in secure computation.
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.
Math. Syst. Theory, 1977

1976
Complexity Measures and Hierarchies for the Evaluation of Integers and Polynomials.
Theor. Comput. Sci., 1976

Multidimensional Searching Problems.
SIAM J. Comput., 1976

On the Number of Multiplications Required for Matrix Multiplication.
SIAM J. Comput., 1976

A Nonlinear Lower Bound on Linear Search Tree Programs for Solving Knapsack Problems.
J. Comput. Syst. Sci., 1976

The Complexity of Vector-Products.
Inf. Process. Lett., 1976

1975
Complexity Measures and Hierarchies for the Evaluation of Integers, Polynomials, and n-linear Forms
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

1974
On Some Generalizations of Binary Search
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
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
Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973


  Loading...