The following pages link to David P. Dobkin (Q584276):
Displaying 50 items.
- Delaunay graphs are almost as good as complete graphs (Q584279) (← links)
- Fast detection of polyhedral intersection (Q759483) (← links)
- Computational geometry in a curved world (Q911324) (← links)
- Searching for empty convex polygons (Q911758) (← links)
- (Q915499) (redirect page) (← links)
- Applied computational geometry: Towards robust solutions of basic problems (Q915501) (← links)
- Decomposition and intersection of simple splinegons (Q1105375) (← links)
- Primitives for the manipulation of three-dimensional subdivisions (Q1115576) (← links)
- Determining the mode (Q1143172) (← links)
- Detecting the intersection of convex objects in the plane (Q1183506) (← links)
- A nonlinear lower bound on linear search tree programs for solving knapsack-problems (Q1230654) (← links)
- Complexity measures and hierarchies for the evaluation of integers and polynomials (Q1241288) (← links)
- The complexity of vector-products (Q1243128) (← links)
- On the optimal evaluation of a set of bilinear forms (Q1245572) (← links)
- A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem (Q1253918) (← links)
- Linear programming is log-space hard for P (Q1255780) (← links)
- On the complexity of computations under varying sets of primitives (Q1259164) (← links)
- An efficient algorithm for finding the CSG representation of a simple polygon (Q1261285) (← links)
- Visibility with a moving point of view (Q1322569) (← links)
- A reflective symmetry descriptor for 3D models (Q1889594) (← links)
- Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning (Q1924382) (← links)
- Computing the intersection-depth to polyhedra (Q2366234) (← links)
- Strategies for polyhedral surface decomposition: an experimental study. (Q2482891) (← links)
- (Q3138884) (← links)
- Finding Extremal Polygons (Q3221405) (← links)
- TEMPORAL COHERENCE IN BOUNDING VOLUME HIERARCHIES FOR COLLISION DETECTION (Q3422190) (← links)
- Shape distributions (Q3549145) (← links)
- A linear algorithm for determining the separation of convex polyhedra (Q3697818) (← links)
- Efficient uses of the past (Q3707438) (← links)
- (Q3750120) (← links)
- Partitioning Space for Range Queries (Q3830566) (← links)
- An Improved Lower Bound on Polynomial Multiplication (Q3868771) (← links)
- Addition Chain Methods for the Evaluation of Specific Polynomials (Q3893297) (← links)
- (Q3906497) (← links)
- Optimal Time Minimal Space Selection Algorithms (Q3911405) (← links)
- (Q3957945) (← links)
- (Q4038707) (← links)
- (Q4080721) (← links)
- (Q4094392) (← links)
- Multidimensional Searching Problems (Q4099207) (← links)
- On the Number of Multiplications Required for Matrix Multiplication (Q4114690) (← links)
- (Q4134963) (← links)
- (Q4136563) (← links)
- Inclusion complete tally languages and the Hartmanis-Berman conjecture (Q4140380) (← links)
- (Q4160413) (← links)
- (Q4195944) (← links)
- (Q4288337) (← links)
- Maintenance of geometric extrema (Q4302837) (← links)
- (Q4318735) (← links)
- The quickhull algorithm for convex hulls (Q4371114) (← links)