Skip to search formSkip to main contentSkip to account menu

David P. Dobkin

Known as: David Dobkin (professor), Dobkin 
David Paul Dobkin is the Dean of the Faculty and Phillip Y. Goldman '86 Professor of Computer Science at Princeton University. Dobkin was born… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Computational geometryComputer graphicsDBL-BrowserDiane Souvaine

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Israeli NGOs and American Jewish Donors: The Structures and Dynamics of Power Sharing in a New Philanthropic Era
2007
2007
Comparison Between Mimetic and Two-Point Flux-Approximation Schemes on PEBI-grids
1998
1998
Colorant Selection for Six-Color Lithographic Printing
Two criteria for selecting ink sets for six-color lithographic printing are discussed. The first is the volume, in CIELAB space… 
1995
1995
Output-sensitive construction of convex hulls
The construction of the convex hull of a nite point set in a low-dimensional Euclidean space is a fundamental problem in… 
1994
1994
Exact and Fast Collision Detection
1993
1993
Trace Size vs. Parallelism in Trace-and-Replay Debugging of Shared-Memory Programs
Execution replay is a debugging strategy in which a program is run over and over on an input that manifests bugs. For explicitly… 
1992
1992
TEMPORAL CHANGES IN ABUNDANCE OF TWO LYCAENID BUTTERFLIES (L YCAENIDAE) IN RELATION TO ADUL T FOOD RESOURCES
The temporal distributions of adult Hypochrysops apelles (F.) and H. epicurus (Miskin) in relation to the abundance of flowering… 
1991
1991
Visibility in Simple Polygons
We present a new method of decomposing a simple polygon which allows the preprocessing of the polygon to e ciently answer queries… 
Review
1978
Review
1978
A survey of algorithms and data structures for range searching
An important problem in database systems is answering queries quickly. This paper surveys a number of algorithms for efficiently… 
Highly Cited
1978
Highly Cited
1978
Relationship Between Density and Deterministic Complexity of NP-Complete Languages
Let Σ be an arbitrary alphabet. denotes ɛ∪Σ∪...∪Σn. We say that a function t, t : is f-sparse iff card for every natural… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)