- Home
- Best Scientists - Mathematics
- David G. Kirkpatrick

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
43
Citations
11,293
172
World Ranking
1133
National Ranking
48

Computer Science
D-index
43
Citations
11,328
175
World Ranking
4923
National Ranking
219

2009 - Fellow of the Royal Society of Canada Academy of Science

- Algorithm
- Geometry
- Artificial intelligence

His primary areas of investigation include Combinatorics, Discrete mathematics, Time complexity, Polyhedron and Algorithm. David G. Kirkpatrick integrates Combinatorics with Subdivision in his study. He interconnects Simple and Logarithm in the investigation of issues within Discrete mathematics.

David G. Kirkpatrick has researched Time complexity in several fields, including Power diagram, Voronoi diagram, Weighted Voronoi diagram and Centroidal Voronoi tessellation. His Polyhedron study integrates concerns from other disciplines, such as Intersection, Robotics and Artificial intelligence. His study in Convex hull is interdisciplinary in nature, drawing from both Delaunay triangulation, Classical theorem, Robot hand, Unit sphere and Ball.

- On the shape of a set of points in the plane (1112 citations)
- Optimal Search in Planar Subdivisions (684 citations)
- Linear time Euclidean distance transform algorithms (407 citations)

Combinatorics, Discrete mathematics, Algorithm, Upper and lower bounds and Time complexity are his primary areas of study. His work deals with themes such as Convex hull and Regular polygon, which intersect with Combinatorics. Efficient algorithm, Facility location problem and Mathematical optimization is closely connected to Plane in his research, which is encompassed under the umbrella topic of Regular polygon.

His studies in Discrete mathematics integrate themes in fields like Intersection, Simple and Degree. The Algorithm study combines topics in areas such as Voronoi diagram and Asynchronous communication. As a part of the same scientific family, David G. Kirkpatrick mostly works in the field of Indifference graph, focusing on Pathwidth and, on occasion, Chordal graph.

- Combinatorics (64.47%)
- Discrete mathematics (41.62%)
- Algorithm (13.20%)

- Combinatorics (64.47%)
- Discrete mathematics (41.62%)
- Time complexity (10.15%)

David G. Kirkpatrick mainly focuses on Combinatorics, Discrete mathematics, Time complexity, Vertex and Bipartite graph. His Combinatorics study combines topics in areas such as Algorithm and Simple polygon. His Algorithm research includes themes of Point, Wireless sensor network, k-nearest neighbors algorithm and Constant factor.

His studies deal with areas such as Upper and lower bounds, Simple and Interval as well as Discrete mathematics. His Time complexity study combines topics from a wide range of disciplines, such as Reachability, Directed graph, Planar, Constant and Space. His Bipartite graph research is multidisciplinary, incorporating elements of Computational complexity theory and Concept class, Teaching dimension.

- Improved Approximation for Guarding Simple Galleries from the Perimeter (42 citations)
- On barrier resilience of sensor networks (18 citations)
- Time-Space tradeoffs for all-nearest-larger-neighbors problems (16 citations)

- Algorithm
- Geometry
- Artificial intelligence

His main research concerns Combinatorics, Discrete mathematics, Time complexity, Approximation algorithm and Vertex. His Combinatorics research is multidisciplinary, relying on both Upper and lower bounds, Competitive analysis, Measure, Constant and Algorithm. His Algorithm study incorporates themes from Widest path problem, Longest path problem, Shortest path problem and Multi path.

His research investigates the link between Discrete mathematics and topics such as Simple polygon that cross with problems in Pointer machine and Variety. His research in Time complexity intersects with topics in Planar, Reachability and Directed graph. David G. Kirkpatrick works mostly in the field of Approximation algorithm, limiting it down to topics relating to Art gallery problem and, in certain cases, Finite set, Perimeter and Net.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

On the shape of a set of points in the plane

H. Edelsbrunner;D. Kirkpatrick;R. Seidel.

IEEE Transactions on Information Theory **(1983)**

1850 Citations

Optimal Search in Planar Subdivisions

David G. Kirkpatrick.

SIAM Journal on Computing **(1981)**

1046 Citations

Linear time Euclidean distance transform algorithms

H. Breu;J. Gil;D. Kirkpatrick;M. Werman.

IEEE Transactions on Pattern Analysis and Machine Intelligence **(1995)**

608 Citations

The ultimate planar convex hull algorithm

David G Kirkpatrick;Raimund Seidel.

SIAM Journal on Computing **(1986)**

523 Citations

Efficient computation of continuous skeletons

David G. Kirkpatrick.

foundations of computer science **(1979)**

416 Citations

Unit disk graph recognition is NP-hard

Heinz Breu;David G. Kirkpatrick.

Computational Geometry: Theory and Applications **(1998)**

390 Citations

A simple parallel tree contraction algorithm

K. Abrahamson;N. Dadoun;D. G. Kirkpatrick;T. Przytycka.

Journal of Algorithms **(1989)**

373 Citations

A Framework for Computational Morphology

David G. Kirkpatrick;John D. Radke.

Machine Intelligence and Pattern Recognition **(1985)**

364 Citations

Quantitative Steinitz's theorems with applications to multifingered grasping

David Kirkpatrick;Bhubaneswar Mishra;Chee-Keng Yap.

Discrete and Computational Geometry **(1992)**

362 Citations

A Linear Algorithm for Determining the Separation of Convex Polyhedra

David P. Dobkin;David G. Kirkpatrick.

Journal of Algorithms **(1983)**

351 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

University of North Carolina at Chapel Hill

Japan Advanced Institute of Science and Technology

Simon Fraser University

National Institutes of Health

Princeton University

Saarland University

New York University

Carleton University

Yale University

University of Washington

Macquarie University

Monash University

Heinrich-Pette-Institute

University of Granada

Technion – Israel Institute of Technology

Wageningen University & Research

Medical College of Wisconsin

University of Quebec at Montreal

Aberystwyth University

East China Normal University

University of California, Los Angeles

Yale University

New York University

Charles University

Arizona State University

University College London

Something went wrong. Please try again later.