The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David P. Dobkin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.018secs, Finished in 0.021secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002