dblp.uni-trier.dewww.uni-trier.de

David P. Dobkin Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2008
102EEBenedict J. Brown, Corey Toler-Franklin, Diego Nehab, Michael Burns, David P. Dobkin, Andreas Vlachopoulos, Christos Doumas, Szymon Rusinkiewicz, Tim Weyrich: A system for high-volume acquisition and matching of fresco fragments: reassembling Theran wall paintings. ACM Trans. Graph. 27(3): (2008)
2006
101EEOren Tropp, Ayellet Tal, Ilan Shimshoni, David P. Dobkin: Temporal Coherence in Bounding Volume Hierarchies for Collision Detection. International Journal of Shape Modeling 12(2): 159-178 (2006)
2004
100EEThomas A. Funkhouser, Michael M. Kazhdan, Philip Shilane, Patrick Min, William Kiefer, Ayellet Tal, Szymon Rusinkiewicz, David P. Dobkin: Modeling by example. ACM Trans. Graph. 23(3): 652-663 (2004)
2003
99EEThomas A. Funkhouser, Patrick Min, Michael M. Kazhdan, Joyce Chen, J. Alex Halderman, David P. Dobkin, David Pokrass Jacobs: A search engine for 3D models. ACM Trans. Graph. 22(1): 83-105 (2003)
98EEMichael M. Kazhdan, Bernard Chazelle, David P. Dobkin, Thomas A. Funkhouser, Szymon Rusinkiewicz: A Reflective Symmetry Descriptor for 3D Models. Algorithmica 38(1): 201-225 (2003)
2002
97EEMichael M. Kazhdan, Bernard Chazelle, David P. Dobkin, Adam Finkelstein, Thomas A. Funkhouser: A Reflective Symmetry Descriptor. ECCV (2) 2002: 642-656
96EERobert Osada, Thomas A. Funkhouser, Bernard Chazelle, David P. Dobkin: Shape distributions. ACM Trans. Graph. 21(4): 807-832 (2002)
2001
95EERobert Osada, Thomas A. Funkhouser, Bernard Chazelle, David P. Dobkin: Matching 3D Models with Shape Distributions. Shape Modeling International 2001: 154-166
94EEDavid P. Dobkin, Ayellet Tal: Efficient and small representation of line arrangements with applications. Symposium on Computational Geometry 2001: 293-301
93EEDavid P. Dobkin, Ayellet Tal: Small representation of line arrangements. Symposium on Computational Geometry 2001: 319-320
1999
92EEAaron W. F. Lee, David P. Dobkin, Wim Sweldens, Peter Schröder: Multiresolution Mesh Morphing. SIGGRAPH 1999: 343-350
91EEDavid P. Dobkin, Alejo Hausner, Emden R. Gansner, Stephen C. North: Uncluttering Force-Directed Graph Layouts. Symposium on Computational Geometry 1999: 425-426
90EEMarshall 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: Emerging Challenges in Computational Topology CoRR cs.CG/9909001: (1999)
1998
89EEAaron W. F. Lee, Wim Sweldens, Peter Schröder, Lawrence C. Cowsar, David P. Dobkin: MAPS: Multiresolution Adaptive Parameterization of Surfaces. SIGGRAPH 1998: 95-104
88EEAlejo Hausner, David P. Dobkin: GAWAIN: Visualizing Geometric Algorithms with Web-Based Animation. Symposium on Computational Geometry 1998: 411-412
87EEDavid P. Dobkin, Emden R. Gansner: A Path Router for Graph Drawing. Symposium on Computational Geometry 1998: 415-416
1997
86 David P. Dobkin, Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North: Implementing a General-Purpose Edge Router. Graph Drawing 1997: 262-271
85 David P. Dobkin: Applied Computational Geormetry - Abstract. WADS 1997: 185
84 Bernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal: Strategies for Polyhedral Surface Decomposition: an Experimental Study. Comput. Geom. 7: 327-342 (1997)
1996
83 David P. Dobkin, Dimitrios Gunopulos: Geometric Problems in Machine Learning. WACG 1996: 121-132
82 David P. Dobkin: Visualizing Geometric Algorithms - State of the Art. WACG 1996: 41-44
81EEDavid P. Dobkin, David Eppstein, Don P. Mitchell: Computing the Discrepancy with Applications to Supersampling Patterns. ACM Trans. Graph. 15(4): 354-376 (1996)
80EEC. Bradford Barber, David P. Dobkin, Hannu Huhdanpaa: The Quickhull Algorithm for Convex Hulls. ACM Trans. Math. Softw. 22(4): 469-483 (1996)
79 David P. Dobkin, Dimitrios Gunopulos, Wolfgang Maass: Computing the Maximum Bichromatic Discrepancy with Applications to Computer Graphics and Machine Learning. J. Comput. Syst. Sci. 52(3): 453-470 (1996)
1995
78EEDavid P. Dobkin, Dimitrios Gunopulos: Concept Learning with Geometric Hypotheses. COLT 1995: 329-336
77EEBernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal: Strategies for Polyhedral Surface Decomposition: An Experimental Study. Symposium on Computational Geometry 1995: 297-305
76EEBernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal: Convex Surface Decomposition. Symposium on Computational Geometry 1995: V9-V10
75EEAyellet Tal, David P. Dobkin: Visualization of Geometric Algorithms. IEEE Trans. Vis. Comput. Graph. 1(2): 194-204 (1995)
74 Marshall W. Bern, David P. Dobkin, David Eppstein: Triangulating polygons without large angles. Int. J. Comput. Geometry Appl. 5: 171-192 (1995)
1994
73 David P. Dobkin, Ayellet Tal: GASP - An Animation System for Computational Geometry. CCCG 1994: 243-249
72 Ayellet Tal, David P. Dobkin: GASP - A System for Visualizing Geometric Algorithms. IEEE Visualization 1994: 149-155
71EEDavid P. Dobkin, Dimitrios Gunopulos: Computing the Rectangle Discrepancy. Symposium on Computational Geometry 1994: 385-386
70EEAyellet Tal, David P. Dobkin: GASP: A System to Facilitate Animating Geometric Algorithms. Symposium on Computational Geometry 1994: 388-389
69 Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman: Visibility with a Moving Point of View. Algorithmica 11(4): 360-378 (1994)
68EEDavid P. Dobkin, Dimitrios Gunopulos, Wolfgang Maass: Computing the Maximum Bichromatic Discrepancy, with applications to Computer Graphics and Machine Learning Electronic Colloquium on Computational Complexity (ECCC) 1(25): (1994)
1993
67EEDavid P. Dobkin, Ayellet Tal: Building and Using Polyhedral Hierarchies. Symposium on Computational Geometry 1993: 394
66EEDavid P. Dobkin, David Eppstein: Computing the Discrepancy. Symposium on Computational Geometry 1993: 47-52
65 David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink: An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon. Algorithmica 10(1): 1-23 (1993)
64 David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri: Computing the Intersection-Depth of Polyhedra. Algorithmica 9(6): 518-533 (1993)
63 Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph, José Soares: On Sparse Spanners of Weighted Graphs. Discrete & Computational Geometry 9: 81-100 (1993)
1992
62EEMarshall W. Bern, David P. Dobkin, David Eppstein: Triangulating Polygons without Large Angles. Symposium on Computational Geometry 1992: 222-231
1991
61EEDavid P. Dobkin, Diane L. Souvaine: Detecting the intersection of convex objects in the plane. Computer Aided Geometric Design 8(3): 181-199 (1991)
60EEDavid P. Dobkin, Subhash Suri: Maintenance of Geometric Extrema. J. ACM 38(2): 275-298 (1991)
1990
59EEDavid P. Dobkin, David G. Kirkpatrick: Determining the Separation of Preprocessed Polyhedra - A Unified Approach. ICALP 1990: 400-413
58 David P. Dobkin, E. S. Panduranga, M. Zhu: A Numerical Method for Rendering Spherical Reflections. IEEE Visualization 1990: 289-297
57EEDavid P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri: Implicitly Searching Convolutions and Computing Depth of Collision. SIGAL International Symposium on Algorithms 1990: 165-180
56 Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman: Visibility with a Moving Point of View. SODA 1990: 107-117
55EEIngo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph: Generating Sparse Spanners for Weighted Graphs. SWAT 1990: 26-37
54EEDavid P. Dobkin, Allan R. Wilks, Silvio V. F. Levy, William P. Thurston: Contour tracing by piecewise linear approximations. ACM Trans. Graph. 9(4): 389-423 (1990)
53 David P. Dobkin, Diane L. Souvaine: Computational Geometry in a Curved World. Algorithmica 5(3): 421-457 (1990)
52 David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars: Searching for Empty Convex Polygons. Algorithmica 5(4): 561-571 (1990)
51 David P. Dobkin, Steven J. Friedman, Kenneth J. Supowit: Delaunay Graphs are almost as Good as Complete Graphs. Discrete & Computational Geometry 5: 399-407 (1990)
50 David P. Dobkin, Deborah Silver: Applied Computational Geometry: Towards Robust Solutions of Basic Problems. J. Comput. Syst. Sci. 40(1): 70-87 (1990)
1989
49 David P. Dobkin, Subhash Suri: Dynamically Computing the Maxima of Decomposable Functions, with Applications FOCS 1989: 488-493
48 David P. Dobkin, Michael J. Laszlo: Primitives for the Manipulation of Three-Dimensional Subdivisions. Algorithmica 4(1): 3-32 (1989)
47 F. Frances Yao, David P. Dobkin, Herbert Edelsbrunner, Mike Paterson: Partitioning Space for Range Queries. SIAM J. Comput. 18(2): 371-384 (1989)
1988
46EEDavid P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink: An efficient algorithm for finding the CSG representation of a simple polygon. SIGGRAPH 1988: 31-40
45EEDavid P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars: Searching for Empty Convex Polygons. Symposium on Computational Geometry 1988: 224-228
44EEDavid P. Dobkin, Deborah Silver: Recipes for Geometry and Numerical Analysis - Part I: An Empirical Study. Symposium on Computational Geometry 1988: 93-105
43 David P. Dobkin, Diane L. Souvaine, Christopher J. Van Wyk: Decomposition and Intersection of Simple Splinegons. Algorithmica 3: 473-485 (1988)
1987
42 David P. Dobkin, Steven J. Friedman, Kenneth J. Supowit: Delaunay Graphs are Almost as Good as Complete Graphs FOCS 1987: 20-26
41EEDavid P. Dobkin, Michael J. Laszlo: Primitives for the Manipulation of Three-Dimensional Subdivisions. Symposium on Computational Geometry 1987: 86-99
40EEBernard Chazelle, David P. Dobkin: Intersection of convex objects in two and three dimensions. J. ACM 34(1): 1-27 (1987)
39 David P. Dobkin, Herbert Edelsbrunner: Space Searching for Intersecting Objects. J. Algorithms 8(3): 348-361 (1987)
1986
38 David P. Dobkin, Herbert Edelsbrunner, Chee-Keng Yap: Probing Convex Polytopes STOC 1986: 424-432
1985
37 David P. Dobkin, David G. Kirkpatrick: A Linear Algorithm for Determining the Separation of Convex Polyhedra. J. Algorithms 6(3): 381-392 (1985)
36 David P. Dobkin, J. Ian Munro: Efficient Uses of the Past. J. Algorithms 6(4): 455-465 (1985)
35 James E. Boyce, David P. Dobkin, Robert L. (Scot) Drysdale III, Leonidas J. Guibas: Finding Extremal Polygons. SIAM J. Comput. 14(1): 134-147 (1985)
1984
34 David P. Dobkin, Herbert Edelsbrunner: Space Searching for Intersecting Objects FOCS 1984: 387-392
1983
33 David P. Dobkin, David G. Kirkpatrick: Fast Detection of Polyhedral Intersection. Theor. Comput. Sci. 27: 241-253 (1983)
1982
32EEDavid P. Dobkin, David G. Kirkpatrick: Fast Detection of Polyhedral Intersections. ICALP 1982: 154-165
31 Gregory R. Andrews, David P. Dobkin, Peter J. Downey: Distributed Allocation with Pools of Servers. PODC 1982: 73-83
30 James E. Boyce, David P. Dobkin, Robert L. (Scot) Drysdale III, Leonidas J. Guibas: Finding Extremal Polygons STOC 1982: 282-289
1981
29 Gregory R. Andrews, David P. Dobkin, Peter J. Downey: Active Data Structures. ICSE 1981: 354-362
28EEDavid P. Dobkin, J. Ian Munro: Optimal Time Minimal Space Selection Algorithms. J. ACM 28(3): 454-461 (1981)
1980
27 David P. Dobkin, J. Ian Munro: Efficient Uses of the Past FOCS 1980: 200-206
26 Bernard Chazelle, David P. Dobkin: Detection is Easier than Computation (Extended Abstract) STOC 1980: 146-153
25 Mark R. Brown, David P. Dobkin: An Improved Lower Bound on Polynomial Multiplication. IEEE Trans. Computers 29(5): 337-340 (1980)
24 David P. Dobkin, Richard J. Lipton: Addition Chain Methods for the Evaluation of Specific Polynomials. SIAM J. Comput. 9(1): 121-125 (1980)
23 David P. Dobkin, Steven P. Reiss: The Complexity of Linear Programming. Theor. Comput. Sci. 11: 1-18 (1980)
22 David P. Dobkin, J. Ian Munro: Determining the Mode. Theor. Comput. Sci. 12: 255-263 (1980)
1979
21 David P. Dobkin, Lawrence Snyder: On a General Method for Maximizing and Minimizing among Certain Geometric Problems (Extended Abstract) FOCS 1979: 9-17
20 Bernard Chazelle, David P. Dobkin: Decomposing a Polygon into its Convex Parts STOC 1979: 38-48
19EEDavid P. Dobkin, Anita K. Jones, Richard J. Lipton: Secure Databases: Protection Against User Influence. ACM Trans. Database Syst. 4(1): 97-106 (1979)
18 David P. Dobkin, Richard J. Lipton, Steven P. Reiss: Linear Programming is Log-Space Hard for P. Inf. Process. Lett. 8(2): 96-97 (1979)
17 David P. Dobkin, Richard J. Lipton: On the Complexity of Computations under Varying Sets of Primitives. J. Comput. Syst. Sci. 18(1): 86-91 (1979)
1978
16EEDavid P. Dobkin, J. Ian Munro: Time and Space Bounds for Selection Problems. ICALP 1978: 192-204
15 Richard A. DeMillo, David P. Dobkin, Richard J. Lipton: Even Data Bases That Lie Can Be Compromised. IEEE Trans. Software Eng. 4(1): 73-75 (1978)
14 David P. Dobkin, Richard J. Lipton: A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem. J. Comput. Syst. Sci. 16(3): 413-417 (1978)
13 Roger W. Brockett, David P. Dobkin: Errata: On the Number of Multiplications Required for Matrix Multiplication. SIAM J. Comput. 7(2): 238 (1978)
1977
12 Ronald V. Book, Celia Wrathall, Alan L. Selman, David P. Dobkin: Inclusion Complete Tally Languages and the Hartmanis-Berman Conjecture. Mathematical Systems Theory 11: 1-8 (1977)
1976
11EEDavid P. Dobkin, Richard J. Lipton: A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem. MFCS 1976: 265-269
10 David P. Dobkin, Jan van Leeuwen: The Complexity of Vector-Products. Inf. Process. Lett. 4(6): 149-154 (1976)
9 David P. Dobkin: A Nonlinear Lower Bound on Linear Search Tree Programs for Solving Knapsack Problems. J. Comput. Syst. Sci. 13(1): 69-73 (1976)
8 David P. Dobkin, Richard J. Lipton: Multidimensional Searching Problems. SIAM J. Comput. 5(2): 181-186 (1976)
7 Roger W. Brockett, David P. Dobkin: On the Number of Multiplications Required for Matrix Multiplication. SIAM J. Comput. 5(4): 624-628 (1976)
6 Richard J. Lipton, David P. Dobkin: Complexity Measures and Hierarchies for the Evaluation of Integers and Polynomials. Theor. Comput. Sci. 3(3): 349-357 (1976)
1975
5 David P. Dobkin, Richard J. Lipton: On the complexity of computations under varying sets of primitives. Automata Theory and Formal Languages 1975: 110-117
4 Richard J. Lipton, David P. Dobkin: Complexity Measures and Hierarchies for the Evaluation of Integers, Polynomials, and n-linear Forms STOC 1975: 1-5
1974
3 David P. Dobkin, Richard J. Lipton: On Some Generalizations of Binary Search STOC 1974: 310-316
1973
2 David P. Dobkin: On the Optimal Evaluation of a Set of n-Linear Forms FOCS 1973: 92-102
1 Roger W. Brockett, David P. Dobkin: On the Optimal Evaluation of a Set of Bilinear Forms STOC 1973: 88-95

Coauthor Index

1Pankaj K. Agarwal [90]
2Ingo Althöfer [55] [63]
3Nina Amenta [90]
4Gregory R. Andrews [29] [31]
5C. Bradford Barber [80]
6Marshall W. Bern [56] [62] [69] [74] [90]
7Ronald V. Book [12]
8James E. Boyce [30] [35]
9Roger W. Brockett [1] [7] [13]
10Benedict J. Brown [102]
11Mark R. Brown [25]
12Michael Burns [102]
13Bernard Chazelle [20] [26] [40] [76] [77] [84] [95] [96] [97] [98]
14Joyce Chen [99]
15L. Paul Chew [90]
16Lawrence C. Cowsar [89]
17Gautam Das [55] [63]
18Richard A. DeMillo [15]
19Tamal K. Dey [90]
20Christos Doumas [102]
21Peter J. Downey [29] [31]
22Robert L. Scot Drysdale (Robert L. (Scot) Drysdale III) [30] [35]
23Herbert Edelsbrunner [34] [38] [39] [45] [47] [52] [90]
24David Eppstein [56] [62] [66] [69] [74] [81] [90]
25Adam Finkelstein [97]
26Steven J. Friedman [42] [51]
27Thomas A. Funkhouser [95] [96] [97] [98] [99] [100]
28Emden R. Gansner [86] [87] [91]
29Cindy Grimm (Cindy M. Grimm) [90]
30Robert L. Grossman [56] [69]
31Leonidas J. Guibas [30] [35] [46] [65] [90]
32Dimitrios Gunopulos [68] [71] [78] [79] [83]
33J. Alex Halderman (John A. Halderman) [99]
34John Harer [90]
35Joel Hass [90]
36Alejo Hausner [88] [91]
37John Hershberger [46] [57] [64] [65]
38Andrew Hicks [90]
39Hannu Huhdanpaa [80]
40David Pokrass Jacobs [99]
41Carroll K. Johnson [90]
42Anita K. Jones [19]
43Deborah Joseph [55] [63]
44Michael M. Kazhdan [97] [98] [99] [100]
45William Kiefer [100]
46David G. Kirkpatrick [32] [33] [37] [57] [59] [64]
47Eleftherios Koutsofios [86]
48Michael J. Laszlo [41] [48]
49Aaron W. F. Lee [89] [92]
50Jan van Leeuwen [10]
51Gilad Lerman [90]
52David Letscher [90]
53Silvio V. F. Levy [54]
54Richard J. Lipton [3] [4] [5] [6] [8] [11] [14] [15] [17] [18] [19] [24]
55Wolfgang Maass [68] [79]
56Patrick Min [99] [100]
57Don P. Mitchell [81]
58J. Ian Munro [16] [22] [27] [28] [36]
59Diego F. Nehab (Diego Nehab) [102]
60Stephen C. North [86] [91]
61Robert Osada [95] [96]
62Mark H. Overmars [45] [52]
63E. S. Panduranga [58]
64Mike Paterson [47]
65Paul E. Plassmann [90]
66Steven P. Reiss [18] [23]
67Szymon Rusinkiewicz [98] [100] [102]
68Peter Schröder [89] [92]
69Eric Sedgwick [90]
70Alan L. Selman [12]
71Philip Shilane [100]
72Ilan Shimshoni [101]
73Nadia Shouraboura [76] [77] [84]
74Deborah Silver [44] [50]
75Jack Snoeyink [46] [65] [90]
76Lawrence Snyder (Larry Snyder) [21]
77José Soares [63]
78Diane L. Souvaine [43] [53] [61]
79Kenneth J. Supowit [42] [51]
80Subhash Suri [49] [57] [60] [64]
81Wim Sweldens [89] [92]
82Ayellet Tal [67] [70] [72] [73] [75] [76] [77] [84] [93] [94] [100] [101]
83William P. Thurston [54]
84Corey Toler-Franklin [102]
85Oren Tropp [101]
86Andreas Vlachopoulos [102]
87Jeff Weeks [90]
88Tim Weyrich [102]
89Allan R. Wilks [54]
90Celia Wrathall [12]
91Christopher J. Van Wyk [43]
92F. Frances Yao (Frances F. Yao, Foong Frances Yao) [47]
93Chee-Keng Yap (Chee Yap) [38] [90]
94M. Zhu [58]
95Denis Zorin [90]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)