Obserwuj
David Kirkpatrick
David Kirkpatrick
Professor of Computer Science, University of British Columbia
Zweryfikowany adres z cs.ubc.ca
Tytuł
Cytowane przez
Cytowane przez
Rok
On the shape of a set of points in the plane
H Edelsbrunner, D Kirkpatrick, R Seidel
IEEE Transactions on information theory 29 (4), 551-559, 1983
19961983
Optimal search in planar subdivisions
D Kirkpatrick
SIAM Journal on Computing 12 (1), 28-35, 1983
10661983
Linear time Euclidean distance transform algorithms
H Breu, J Gil, D Kirkpatrick, M Werman
IEEE Transactions on Pattern Analysis and Machine Intelligence 17 (5), 529-533, 1995
6181995
The ultimate planar convex hull algorithm?
DG Kirkpatrick, R Seidel
SIAM journal on computing 15 (1), 287-299, 1986
5761986
Unit disk graph recognition is NP-hard
H Breu, DG Kirkpatrick
Computational Geometry 9 (1-2), 3-24, 1998
4161998
Efficient computation of continuous skeletons
DG Kirkpatrick
20th Annual Symposium on Foundations of Computer Science (sfcs 1979), 18-27, 1979
4041979
A framework for computational morphology
DG Kirkpatrick, JD Radke
Machine Intelligence and Pattern Recognition 2, 217-248, 1985
3761985
A simple parallel tree contraction algorithm
K Abrahamson, N Dadoun, DG Kirkpatrick, T Przytycka
Journal of Algorithms 10 (2), 287-302, 1989
3691989
A linear algorithm for determining the separation of convex polyhedra
DP Dobkin, DG Kirkpatrick
Journal of algorithms 6 (3), 381-392, 1985
3481985
Determining the separation of preprocessed polyhedra—a unified approach
DP Dobkin, DG Kirkpatrick
Automata, Languages and Programming: 17th International Colloquium Warwick …, 1990
3061990
Quantitative steinitz's theorems with applications to multifingered grasping
DG Kirkpatrick, B Mishra, CK Yap
Proceedings of the twenty-second annual ACM Symposium on Theory of Computing …, 1990
2701990
Fast detection of polyhedral intersection
DP Dobkin, DG Kirkpatrick
Theoretical computer science 27 (3), 241-253, 1983
2641983
On the complexity of general graph factor problems
DG Kirkpatrick, P Hell
SIAM Journal on Computing 12 (3), 601-609, 1983
2221983
On the spanning ratio of gabriel graphs and β-skeletons
P Bose, L Devroye, W Evans, D Kirkpatrick
LATIN 2002: Theoretical Informatics: 5th Latin American Symposium Cancun …, 2002
214*2002
On the completeness of a generalized matching problem
DG Kirkpatrick, P Hell
Proceedings of the tenth annual ACM symposium on Theory of computing, 240-245, 1978
2011978
Right-triangulated irregular networks
W Evans, D Kirkpatrick, G Townsend
Algorithmica 30, 264-286, 2001
1982001
Computing the intersection-depth of polyhedra
D Dobkin, J Hershberger, D Kirkpatrick, S Suri
Algorithmica 9 (6), 518-533, 1993
1901993
Kinetic collision detection for simple polygons
D Kirkpatrick, J Snoeyink, B Speckmann
Proceedings of the sixteenth annual symposium on Computational geometry, 322-330, 2000
1462000
A time-space tradeoff for sorting on non-oblivious machines
A Borodin, MJ Fischer, DG Kirkpatrick, NA Lynch, M Tompa
20th Annual Symposium on Foundations of Computer Science (sfcs 1979), 319-327, 1979
1411979
Generalizing ham sandwich cuts to equitable subdivisions
S Bespamyatnikh, D Kirkpatrick, J Snoeyink
Proceedings of the fifteenth annual symposium on Computational geometry, 49-58, 1999
1281999
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20