David P. Dobkin

111 papers A* 22A 3B 3Journal 53Unranked 27

Year	Rank	Type	Title / Venue / Authors
2011	—	`conf`	Learning How to Match Fresco Fragments. Eurographics (Areas Papers) Thomas A. Funkhouser, Hijung Shin, Corey Toler-Franklin, Antonio García Castañeda, Benedict J. Brown, David P. Dobkin, Szymon Rusinkiewicz, Tim Weyrich
2011	J	`jnl`	Learning how to match fresco fragments. ACM Journal on Computing and Cultural Heritage Thomas A. Funkhouser, Hijung Shin, Corey Toler-Franklin, Antonio García Castañeda, Benedict J. Brown, David P. Dobkin, Szymon Rusinkiewicz, Tim Weyrich
2008	J	`jnl`	A system for high-volume acquisition and matching of fresco fragments: reassembling Theran wall paintings. ACM Trans. Graph. Benedict J. Brown, Corey Toler-Franklin, Diego Nehab, Michael Burns, David P. Dobkin, Andreas Vlachopoulos, Christos Doumas, Szymon Rusinkiewicz, Tim Weyrich
2006	J	`jnl`	Temporal Coherence in Bounding Volume Hierarchies for Collision Detection. Int. J. Shape Model. Oren Tropp, Ayellet Tal, Ilan Shimshoni, David P. Dobkin
2004	J	`jnl`	A Reflective Symmetry Descriptor for 3D Models. Algorithmica Michael M. Kazhdan, Bernard Chazelle, David P. Dobkin, Thomas A. Funkhouser, Szymon Rusinkiewicz
2004	—	`ch.`	Computer graphics. Handbook of Discrete and Computational Geometry, 2nd Ed. David P. Dobkin, Seth J. Teller
2004	J	`jnl`	Modeling by example. ACM Trans. Graph. Thomas A. Funkhouser, Michael M. Kazhdan, Philip Shilane, Patrick Min, William Kiefer, Ayellet Tal, Szymon Rusinkiewicz, David P. Dobkin
2003	J	`jnl`	A search engine for 3D models. ACM Trans. Graph. Thomas A. Funkhouser, Patrick Min, Michael M. Kazhdan, Joyce Chen, J. Alex Halderman, David P. Dobkin, David Pokrass Jacobs
2002	—	`conf`	A Reflective Symmetry Descriptor. ECCV (2) Michael M. Kazhdan, Bernard Chazelle, David P. Dobkin, Adam Finkelstein, Thomas A. Funkhouser
2002	J	`jnl`	Shape distributions. ACM Trans. Graph. Robert Osada, Thomas A. Funkhouser, Bernard Chazelle, David P. Dobkin
2001	—	`conf`	Efficient and small representation of line arrangements with applications. SCG David P. Dobkin, Ayellet Tal
2001	—	`conf`	Matching 3D Models with Shape Distributions. Shape Modeling International Robert Osada, Thomas A. Funkhouser, Bernard Chazelle, David P. Dobkin
2001	—	`conf`	Small representation of line arrangements. SCG David P. Dobkin, Ayellet Tal
2000	—	`ch.`	Making Geometry Visible: An Introduction to the Animation of Geometric Algorithms. Handbook of Computational Geometry Alejo Hausner, David P. Dobkin
1999	J	`jnl`	Emerging Challenges in Computational Topology CoRR 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
1999	A*	`conf`	Multiresolution Mesh Morphing. SIGGRAPH Aaron W. F. Lee, David P. Dobkin, Wim Sweldens, Peter Schröder
1999	—	`conf`	Uncluttering Force-Directed Graph Layouts. SCG David P. Dobkin, Alejo Hausner, Emden R. Gansner, Stephen C. North
1998	—	`conf`	A Path Router for Graph Drawing. SCG David P. Dobkin, Emden R. Gansner
1998	—	`conf`	GAWAIN: Visualizing Geometric Algorithms with Web-Based Animation. SCG Alejo Hausner, David P. Dobkin
1998	A*	`conf`	MAPS: Multiresolution Adaptive Parameterization of Surfaces. SIGGRAPH Aaron W. F. Lee, Wim Sweldens, Peter Schröder, Lawrence C. Cowsar, David P. Dobkin
1997	B	`conf`	Applied Computational Geormetry - Abstract. WADS David P. Dobkin
1997	A	`conf`	Implementing a General-Purpose Edge Router. GD David P. Dobkin, Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North
1997	J	`jnl`	Strategies for Polyhedral Surface Decomposition: an Experimental Study. Comput. Geom. Bernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal
1996	J	`jnl`	Computing the Discrepancy with Applications to Supersampling Patterns. ACM Trans. Graph. David P. Dobkin, David Eppstein, Don P. Mitchell
1996	J	`jnl`	Computing the Maximum Bichromatic Discrepancy with Applications to Computer Graphics and Machine Learning. J. Comput. Syst. Sci. David P. Dobkin, Dimitrios Gunopulos, Wolfgang Maass
1996	—	`conf`	Geometric Problems in Machine Learning. WACG David P. Dobkin, Dimitrios Gunopulos
1996	J	`jnl`	The Quickhull Algorithm for Convex Hulls. ACM Trans. Math. Softw. C. Bradford Barber, David P. Dobkin, Hannu Huhdanpaa
1996	—	`conf`	Visualizing Geometric Algorithms - State of the Art. WACG David P. Dobkin
1995	A*	`conf`	Concept Learning with Geometric Hypotheses. COLT David P. Dobkin, Dimitrios Gunopulos
1995	—	`conf`	Convex Surface Decomposition. SCG Bernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal
1995	—	`conf`	Strategies for Polyhedral Surface Decomposition: An Experimental Study. SCG Bernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal
1995	J	`jnl`	Triangulating polygons without large angles. Int. J. Comput. Geom. Appl. Marshall W. Bern, David P. Dobkin, David Eppstein
1995	J	`jnl`	Visualization of Geometric Algorithms. IEEE Trans. Vis. Comput. Graph. Ayellet Tal, David P. Dobkin
1994	J	`jnl`	Computing the Maximum Bichromatic Discrepancy, with applications to Computer Graphics and Machine Learning Electron. Colloquium Comput. Complex. David P. Dobkin, Dimitrios Gunopulos, Wolfgang Maass
1994	—	`conf`	Computing the Rectangle Discrepancy. SCG David P. Dobkin, Dimitrios Gunopulos
1994	A	`conf`	GASP - A System for Visualizing Geometric Algorithms. IEEE Visualization Ayellet Tal, David P. Dobkin
1994	—	`conf`	GASP - An Animation System for Computational Geometry. CCCG David P. Dobkin, Ayellet Tal
1994	—	`conf`	GASP: A System to Facilitate Animating Geometric Algorithms. SCG Ayellet Tal, David P. Dobkin
1994	J	`jnl`	Visibility with a Moving Point of View. Algorithmica Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman
1993	J	`jnl`	An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon. Algorithmica David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink
1993	—	`conf`	Building and Using Polyhedral Hierarchies. SCG David P. Dobkin, Ayellet Tal
1993	—	`conf`	Computing the Discrepancy. SCG David P. Dobkin, David Eppstein
1993	J	`jnl`	Computing the Intersection-Depth of Polyhedra. Algorithmica David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri
1993	J	`jnl`	On Sparse Spanners of Weighted Graphs. Discret. Comput. Geom. Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph, José Soares
1992	J	`jnl`	Computational geometry and computer graphics. Proc. IEEE David P. Dobkin
1992	—	`conf`	Triangulating Polygons without Large Angles. SCG Marshall W. Bern, David P. Dobkin, David Eppstein
1991	J	`jnl`	Detecting the intersection of convex objects in the plane. Comput. Aided Geom. Des. David P. Dobkin, Diane L. Souvaine
1991	J	`jnl`	Maintenance of Geometric Extrema. J. ACM David P. Dobkin, Subhash Suri
1990	A	`conf`	A Numerical Method for Rendering Spherical Reflections. IEEE Visualization David P. Dobkin, E. S. Panduranga, M. Zhu
1990	—	`conf`	A viewer for mathematical structures and surfaces in 3D. I3D David P. Dobkin, Stephen C. North, Nathaniel J. Thurston
1990	J	`jnl`	Applied Computational Geometry: Towards Robust Solutions of Basic Problems. J. Comput. Syst. Sci. David P. Dobkin, Deborah Silver
1990	J	`jnl`	Computational Geometry in a Curved World. Algorithmica David P. Dobkin, Diane L. Souvaine
1990	J	`jnl`	Contour tracing by piecewise linear approximations. ACM Trans. Graph. David P. Dobkin, Allan R. Wilks, Silvio V. F. Levy, William P. Thurston
1990	J	`jnl`	Delaunay Graphs are almost as Good as Complete Graphs. Discret. Comput. Geom. David P. Dobkin, Steven J. Friedman, Kenneth J. Supowit
1990	A*	`conf`	Determining the Separation of Preprocessed Polyhedra - A Unified Approach. ICALP David P. Dobkin, David G. Kirkpatrick
1990	—	`conf`	Generating Sparse Spanners for Weighted Graphs. SWAT Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph
1990	—	`conf`	Implicitly Searching Convolutions and Computing Depth of Collision. SIGAL International Symposium on Algorithms David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri
1990	—	`ch.`	Probing Convex Polytopes. Autonomous Robot Vehicles David P. Dobkin, Herbert Edelsbrunner, Chee K. Yap
1990	J	`jnl`	Searching for Empty Convex Polygons. Algorithmica David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars
1990	A*	`conf`	Visibility with a Moving Point of View. SODA Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman
1989	A*	`conf`	Dynamically Computing the Maxima of Decomposable Functions, with Applications FOCS David P. Dobkin, Subhash Suri
1989	J	`jnl`	Partitioning Space for Range Queries. SIAM J. Comput. F. Frances Yao, David P. Dobkin, Herbert Edelsbrunner, Mike Paterson
1989	J	`jnl`	Primitives for the Manipulation of Three-Dimensional Subdivisions. Algorithmica David P. Dobkin, Michael J. Laszlo
1988	—	`conf`	A library for incremental update of bitmap images. DOCPROCS David P. Dobkin, Eleftherios Koutsofios, Rob Pike
1988	A*	`conf`	An efficient algorithm for finding the CSG representation of a simple polygon. SIGGRAPH David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink
1988	J	`jnl`	Decomposition and Intersection of Simple Splinegons. Algorithmica David P. Dobkin, Diane L. Souvaine, Christopher J. Van Wyk
1988	—	`conf`	Recipes for Geometry and Numerical Analysis - Part I: An Empirical Study. SCG David P. Dobkin, Deborah Silver
1988	—	`conf`	Searching for Empty Convex Polygons. SCG David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars
1987	A*	`conf`	Delaunay Graphs are Almost as Good as Complete Graphs FOCS David P. Dobkin, Steven J. Friedman, Kenneth J. Supowit
1987	J	`jnl`	Intersection of convex objects in two and three dimensions. J. ACM Bernard Chazelle, David P. Dobkin
1987	—	`conf`	Primitives for the Manipulation of Three-Dimensional Subdivisions. SCG David P. Dobkin, Michael J. Laszlo
1987	J	`jnl`	Space Searching for Intersecting Objects. J. Algorithms David P. Dobkin, Herbert Edelsbrunner
1986	A*	`conf`	Probing Convex Polytopes STOC David P. Dobkin, Herbert Edelsbrunner, Chee-Keng Yap
1985	J	`jnl`	A Linear Algorithm for Determining the Separation of Convex Polyhedra. J. Algorithms David P. Dobkin, David G. Kirkpatrick
1985	J	`jnl`	Efficient Uses of the Past. J. Algorithms David P. Dobkin, J. Ian Munro
1985	J	`jnl`	Finding Extremal Polygons. SIAM J. Comput. James E. Boyce, David P. Dobkin, Robert L. (Scot) Drysdale III, Leonidas J. Guibas
1984	A*	`conf`	Space Searching for Intersecting Objects FOCS David P. Dobkin, Herbert Edelsbrunner
1983	J	`jnl`	Fast Detection of Polyhedral Intersection. Theor. Comput. Sci. David P. Dobkin, David G. Kirkpatrick
1982	A*	`conf`	Distributed Allocation with Pools of Servers. PODC Gregory R. Andrews, David P. Dobkin, Peter J. Downey
1982	A*	`conf`	Fast Detection of Polyhedral Intersections. ICALP David P. Dobkin, David G. Kirkpatrick
1982	A*	`conf`	Finding Extremal Polygons STOC James E. Boyce, David P. Dobkin, Robert L. (Scot) Drysdale III, Leonidas J. Guibas
1981	A*	`conf`	Active Data Structures. ICSE Gregory R. Andrews, David P. Dobkin, Peter J. Downey
1981	J	`jnl`	Optimal Time Minimal Space Selection Algorithms. J. ACM David P. Dobkin, J. Ian Munro
1980	J	`jnl`	Addition Chain Methods for the Evaluation of Specific Polynomials. SIAM J. Comput. David P. Dobkin, Richard J. Lipton
1980	J	`jnl`	An Improved Lower Bound on Polynomial Multiplication. IEEE Trans. Computers Mark R. Brown, David P. Dobkin
1980	A*	`conf`	Detection is Easier than Computation (Extended Abstract) STOC Bernard Chazelle, David P. Dobkin
1980	J	`jnl`	Determining the Mode. Theor. Comput. Sci. David P. Dobkin, J. Ian Munro
1980	A*	`conf`	Efficient Uses of the Past FOCS David P. Dobkin, J. Ian Munro
1980	J	`jnl`	The Complexity of Linear Programming. Theor. Comput. Sci. David P. Dobkin, Steven P. Reiss
1979	A*	`conf`	Decomposing a Polygon into its Convex Parts STOC Bernard Chazelle, David P. Dobkin
1979	J	`jnl`	Linear Programming is Log-Space Hard for P. Inf. Process. Lett. David P. Dobkin, Richard J. Lipton, Steven P. Reiss
1979	A*	`conf`	On a General Method for Maximizing and Minimizing among Certain Geometric Problems (Extended Abstract) FOCS David P. Dobkin, Lawrence Snyder
1979	J	`jnl`	On the Complexity of Computations under Varying Sets of Primitives. J. Comput. Syst. Sci. David P. Dobkin, Richard J. Lipton
1979	J	`jnl`	Secure Databases: Protection Against User Influence. ACM Trans. Database Syst. David P. Dobkin, Anita K. Jones, Richard J. Lipton
1978	J	`jnl`	A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem. J. Comput. Syst. Sci. David P. Dobkin, Richard J. Lipton
1978	J	`jnl`	Errata: On the Number of Multiplications Required for Matrix Multiplication. SIAM J. Comput. Roger W. Brockett, David P. Dobkin
1978	J	`jnl`	Even Data Bases That Lie Can Be Compromised. IEEE Trans. Software Eng. Richard A. DeMillo, David P. Dobkin, Richard J. Lipton
1978	B	`conf`	Recent progress in secure computation. COMPSAC Richard A. DeMillo, David P. Dobkin
1978	A*	`conf`	Time and Space Bounds for Selection Problems. ICALP David P. Dobkin, J. Ian Munro
1977	J	`jnl`	Inclusion Complete Tally Languages and the Hartmanis-Berman Conjecture. Math. Syst. Theory Ronald V. Book, Celia Wrathall, Alan L. Selman, David P. Dobkin
1976	B	`conf`	A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem. MFCS David P. Dobkin, Richard J. Lipton
1976	J	`jnl`	A Nonlinear Lower Bound on Linear Search Tree Programs for Solving Knapsack Problems. J. Comput. Syst. Sci. David P. Dobkin
1976	J	`jnl`	Complexity Measures and Hierarchies for the Evaluation of Integers and Polynomials. Theor. Comput. Sci. Richard J. Lipton, David P. Dobkin
1976	J	`jnl`	Multidimensional Searching Problems. SIAM J. Comput. David P. Dobkin, Richard J. Lipton
1976	J	`jnl`	On the Number of Multiplications Required for Matrix Multiplication. SIAM J. Comput. Roger W. Brockett, David P. Dobkin
1976	J	`jnl`	The Complexity of Vector-Products. Inf. Process. Lett. David P. Dobkin, Jan van Leeuwen
1975	A*	`conf`	Complexity Measures and Hierarchies for the Evaluation of Integers, Polynomials, and n-linear Forms STOC Richard J. Lipton, David P. Dobkin
1975	—	`conf`	On the complexity of computations under varying sets of primitives. Automata Theory and Formal Languages David P. Dobkin, Richard J. Lipton
1974	A*	`conf`	On Some Generalizations of Binary Search STOC David P. Dobkin, Richard J. Lipton
1973	A*	`conf`	On the Optimal Evaluation of a Set of Bilinear Forms STOC Roger W. Brockett, David P. Dobkin
1973	—	`conf`	On the Optimal Evaluation of a Set of n-Linear Forms SWAT David P. Dobkin