David P. Dobkin

From MaRDI portal
(Redirected from Person:584276)
David P. Dobkin Q584276



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Visualizing geometric algorithms -- state of the art2024-06-21Paper
Geometric problems in machine learning2024-06-21Paper
Generating sparse spanners for weighted graphs
SWAT 90
2022-12-09Paper
Efficient and small representation of line arrangements with applications
Proceedings of the seventeenth annual symposium on Computational geometry
2017-09-29Paper
Shape distributions
ACM Transactions on Graphics
2008-12-21Paper
Strategies for polyhedral surface decomposition: an experimental study.
Computational Geometry
2008-04-25Paper
TEMPORAL COHERENCE IN BOUNDING VOLUME HIERARCHIES FOR COLLISION DETECTION
International Journal of Shape Modeling
2007-02-09Paper
A reflective symmetry descriptor for 3D models
Algorithmica
2004-12-02Paper
scientific article; zbMATH DE number 1424296 (Why is no real title available?)2000-08-01Paper
scientific article; zbMATH DE number 708843 (Why is no real title available?)2000-06-21Paper
scientific article; zbMATH DE number 1182935 (Why is no real title available?)1998-08-02Paper
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software
1998-01-07Paper
Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning
Journal of Computer and System Sciences
1996-11-26Paper
TRIANGULATING POLYGONS WITHOUT LARGE ANGLES
International Journal of Computational Geometry & Applications
1995-05-17Paper
Maintenance of geometric extrema
Journal of the ACM
1994-11-13Paper
scientific article; zbMATH DE number 554531 (Why is no real title available?)1994-05-19Paper
Visibility with a moving point of view
Algorithmica
1994-05-05Paper
scientific article; zbMATH DE number 432756 (Why is no real title available?)1994-01-02Paper
An efficient algorithm for finding the CSG representation of a simple polygon
Algorithmica
1993-09-01Paper
Computing the intersection-depth to polyhedra
Algorithmica
1993-06-29Paper
scientific article; zbMATH DE number 177829 (Why is no real title available?)1993-05-18Paper
Detecting the intersection of convex objects in the plane
Computer Aided Geometric Design
1992-06-28Paper
Delaunay graphs are almost as good as complete graphs
Discrete & Computational Geometry
1990-01-01Paper
Searching for empty convex polygons
Algorithmica
1990-01-01Paper
Computational geometry in a curved world
Algorithmica
1990-01-01Paper
Applied computational geometry: Towards robust solutions of basic problems
Journal of Computer and System Sciences
1990-01-01Paper
Partitioning Space for Range Queries
SIAM Journal on Computing
1989-01-01Paper
Primitives for the manipulation of three-dimensional subdivisions
Algorithmica
1989-01-01Paper
Decomposition and intersection of simple splinegons
Algorithmica
1988-01-01Paper
Space searching for intersecting objects
Journal of Algorithms
1987-01-01Paper
Space searching for intersecting objects
Journal of Algorithms
1987-01-01Paper
A linear algorithm for determining the separation of convex polyhedra
Journal of Algorithms
1985-01-01Paper
Finding Extremal Polygons
SIAM Journal on Computing
1985-01-01Paper
scientific article; zbMATH DE number 3986641 (Why is no real title available?)1985-01-01Paper
Efficient uses of the past
Journal of Algorithms
1985-01-01Paper
Fast detection of polyhedral intersection
Theoretical Computer Science
1983-01-01Paper
scientific article; zbMATH DE number 3800943 (Why is no real title available?)1983-01-01Paper
scientific article; zbMATH DE number 3778747 (Why is no real title available?)1982-01-01Paper
Optimal Time Minimal Space Selection Algorithms
Journal of the ACM
1981-01-01Paper
Determining the mode
Theoretical Computer Science
1980-01-01Paper
The complexity of linear programming
Theoretical Computer Science
1980-01-01Paper
Addition Chain Methods for the Evaluation of Specific Polynomials
SIAM Journal on Computing
1980-01-01Paper
An Improved Lower Bound on Polynomial Multiplication
IEEE Transactions on Computers
1980-01-01Paper
Linear programming is log-space hard for P
Information Processing Letters
1979-01-01Paper
On the complexity of computations under varying sets of primitives
Journal of Computer and System Sciences
1979-01-01Paper
On the optimal evaluation of a set of bilinear forms
Linear Algebra and its Applications
1978-01-01Paper
A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem
Journal of Computer and System Sciences
1978-01-01Paper
scientific article; zbMATH DE number 3594653 (Why is no real title available?)1978-01-01Paper
scientific article; zbMATH DE number 3715013 (Why is no real title available?)1977-01-01Paper
Inclusion complete tally languages and the Hartmanis-Berman conjecture
Mathematical Systems Theory
1977-01-01Paper
Complexity measures and hierarchies for the evaluation of integers and polynomials
Theoretical Computer Science
1977-01-01Paper
scientific article; zbMATH DE number 3635497 (Why is no real title available?)1977-01-01Paper
Multidimensional Searching Problems
SIAM Journal on Computing
1976-01-01Paper
On the Number of Multiplications Required for Matrix Multiplication
SIAM Journal on Computing
1976-01-01Paper
A nonlinear lower bound on linear search tree programs for solving knapsack-problems
Journal of Computer and System Sciences
1976-01-01Paper
scientific article; zbMATH DE number 3564333 (Why is no real title available?)1976-01-01Paper
The complexity of vector-products
Information Processing Letters
1976-01-01Paper
scientific article; zbMATH DE number 3499229 (Why is no real title available?)1975-01-01Paper
scientific article; zbMATH DE number 3562512 (Why is no real title available?)1974-01-01Paper
scientific article; zbMATH DE number 3514983 (Why is no real title available?)1973-01-01Paper


Research outcomes over time


This page was built for person: David P. Dobkin