David P. Dobkin
#168,896
Most Influential Person Now
David P. Dobkin's AcademicInfluence.com Rankings
David P. Dobkinmathematics Degrees
Mathematics
#7627
World Rank
#10344
Historical Rank
Geometry
#173
World Rank
#247
Historical Rank
Measure Theory
#2370
World Rank
#2834
Historical Rank
Download Badge
Mathematics Computer Science
David P. Dobkin's Degrees
- PhD Computer Science Cornell University
- Masters Computer Science Cornell University
Similar Degrees You Can Earn
Why Is David P. Dobkin Influential?
(Suggest an Edit or Addition)David P. Dobkin's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- The quickhull algorithm for convex hulls (1996) (4956)
- Shape distributions (2002) (1745)
- A search engine for 3D models (2003) (1074)
- MAPS: multiresolution adaptive parameterization of surfaces (1998) (750)
- Matching 3D models with shape distributions (2001) (687)
- Modeling by example (2004) (588)
- On sparse spanners of weighted graphs (1993) (552)
- Multiresolution mesh morphing (1999) (287)
- Delaunay graphs are almost as good as complete graphs (1987) (285)
- Multidimensional Searching Problems (1976) (252)
- Secure databases: protection against user influence (1979) (250)
- Primitives for the manipulation of three-dimensional subdivisions (1987) (250)
- Determining the Separation of Preprocessed Polyhedra - A Unified Approach (1990) (248)
- A Linear Algorithm for Determining the Separation of Convex Polyhedra (1985) (244)
- A Reflective Symmetry Descriptor for 3D Models (2003) (237)
- Fast Detection of Polyhedral Intersection (1983) (214)
- Intersection of convex objects in two and three dimensions (1987) (176)
- A system for high-volume acquisition and matching of fresco fragments: reassembling Theran wall paintings (2008) (168)
- Strategies for polyhedral surface decomposition: an experimental study (1995) (161)
- Foundations of Secure Computation (1978) (155)
- Optimal Convex Decompositions (1985) (143)
- On the Complexity of Computations under Varying Sets of Primitives (1975) (139)
- A Reflective Symmetry Descriptor (2002) (133)
- Finding extremal polygons (1982) (125)
- On the optimal evaluation of a set of bilinear forms (1973) (119)
- Computing the intersection-depth of polyhedra (1993) (115)
- Decomposing a polygon into its convex parts (1979) (114)
- Linear Programming is Log-Space Hard for P (1979) (111)
- Computing the discrepancy with applications to supersampling patterns (1996) (95)
- Probing convex polytopes (1986) (89)
- Visibility with a moving point of view (1994) (86)
- On a general method for maximizing and minimizing among certain geometric problems (1979) (86)
- Contour tracing by piecewise linear approximations (1990) (83)
- Generating Sparse Spanners for Weighted Graphs (1990) (77)
- Computing the Maximum Bichromatic Discrepancy with Applications to Computer Graphics and Machine Learning (1996) (76)
- Visualization of Geometric Algorithms (1995) (69)
- A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem (1978) (69)
- Fast Detection of Polyhedral Intersections (1982) (67)
- Space Searching for Intersecting Objects (1984) (67)
- Recipes for geometry and numerical analysis - Part I: an empirical study (1988) (66)
- Learning how to match fresco fragments (2011) (58)
- Computational geometry in a curved world (1990) (56)
- An efficient algorithm for finding the CSG representation of a simple polygon (1988) (55)
- Emerging Challenges in Computational Topology (1999) (54)
- Searching for empty convex polygons (1988) (51)
- Detection is easier than computation (Extended Abstract) (1980) (49)
- Efficient uses of the past (1980) (49)
- Implementing a General-Purpose Edge Router (1997) (44)
- Partitioning Space for Range Queries (1989) (41)
- Computing the discrepancy (1993) (41)
- Even Data Bases That Lie Can Be Compromised (1978) (41)
- A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem (1976) (40)
- Distributed allocation with pools of servers (1982) (38)
- Triangulating polygons without large angles (1992) (38)
- An Improved Lower Bound on Polynomial Multiplication (1980) (33)
- On the Number of Multiplications Required for Matrix Multiplication (1976) (32)
- Applied Computational Geometry: Towards Robust Solutions of Basic Problems (1990) (30)
- Maintenance of geometric extrema ∈ (1991) (28)
- The Complexity of Linear Programming (1980) (27)
- Optimal Time Minimal Space Selection Algorithms (1981) (25)
- Computational geometry and computer graphics (1992) (25)
- Implicitly Searching Convolutions and Computing Depth of Collision (1990) (24)
- Concept learning with geometric hypotheses (1995) (24)
- Random-edge discrepancy of supersampling patterns (1993) (22)
- Decomposition and intersection of simple splinegons (1988) (22)
- Determining the Mode (1980) (22)
- Dynamically computing the maxima of decomposable functions, with applications (1989) (18)
- Computing the rectangle discrepancy (1994) (17)
- Temporal Coherence in Bounding Volume Hierarchies for Collision Detection (2006) (15)
- Detecting the intersection of convex objects in the plane (1991) (15)
- On some generalizations of binary search (1974) (15)
- GASP: a system to facilitate animating geometric algorithms (1994) (14)
- A Nonlinear Lower Bound on Linear Search Tree Programs for Solving Knapsack Problems (1976) (14)
- Addition Chain Methods for the Evaluation of Specific Polynomials (1980) (14)
- GAWAIN: visualizing geometric algorithms with Web-based animation (1998) (12)
- Induction of shallow decision trees (2007) (11)
- Making Geometry Visible: An Introduction to the Animation of Geometric Algorithms (2000) (11)
- Efficient and small representation of line arrangements with applications (2001) (11)
- Uncluttering force-directed graph layouts (1999) (10)
- Complexity Measures and Hierarchies for the Evaluation of Integers and Polynomials (1976) (9)
- GASP-a system for visualizing geometric algorithms (1994) (8)
- A path router for graph drawing (1998) (7)
- Active data structures (1981) (6)
- Computational Geometry — Then and Now (1988) (6)
- Recent progress in secure computation (1978) (6)
- Convex surface decomposition (1995) (5)
- The Complexity of Vector-Products (1976) (5)
- Inclusion complete tally languages and the Hartmanis-Berman conjecture (1977) (5)
- Building and using polyhedral hierarchies (1993) (4)
- Time and Space Bounds for Selection Problems (1978) (4)
- Geometric Problems in Machine Learning (1996) (4)
- A viewer for mathematical structures and surfaces in 3D (1990) (3)
- Complexity measures and hierarchies for the evaluation of integers, polynomials, and n-linear forms (1975) (2)
- Visualizing Geometric Algorithms - State of the Art (1996) (2)
- Web-based animation of geometric algorithms (2001) (1)
- GASP - An Animation System for Computational Geometry (1994) (1)
- Small representation of line arrangements (2001) (1)
- The Complexity of Searching Lines in the Plane: Preliminary Version. (1975) (1)
- Computer graphics (2004) (1)
- Errata: On the Number of Multiplications Required for Matrix Multiplication (1978) (0)
- The geometry of circles : Voronoi diagrams , Möbius transformations , Convex Hulls , Fortune ’ s algorithm , the cut locus and parametrization of shapes (2010) (0)
- A Numerical Met hod for Rendering Spherical Reflect ions (1990) (0)
- A.2 Linear Summation Queries with 1-bit Answers a Lower Bounds A.1 the Single Database Case 7 Privacy with Respect to Coalitions (1996) (0)
- On the Complexity of Linear Search Tree Programs for Searching (Extended Abstract). (1975) (0)
- 42 Computer Graphics (1996) (0)
- VISUALIZING MATHEMATICS AND COMPUTATION (1993) (0)
- Multiresolution surface parametrization and applications (2000) (0)
- Evaluation of the use of fiber optic sensors in identification of fresco fracturing patterns (2015) (0)
- A numerical method for rendering spherical reflections (1990) (0)
- Storing the Subdivision o f a Polyhedral Surface (2005) (0)
- Applied Computational Geormetry - Abstract (1997) (0)
- AASERT: Software Tools for Experimentation in Computational Geometry (2001) (0)
- A library for incremental update of bitmap images (2000) (0)
This paper list is powered by the following services:
What Schools Are Affiliated With David P. Dobkin?
David P. Dobkin is affiliated with the following schools:
