D-Index & Metrics Best Publications

D-Index & Metrics 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.

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

Research.com Recognitions

Awards & Achievements

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

Overview

What is he best known for?

The fields of study he is best known for:

  • 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.

His most cited work include:

  • 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)

What are the main themes of his work throughout his whole career to date?

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.

He most often published in these fields:

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

What were the highlights of his more recent work (between 2010-2021)?

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

In recent papers he was focusing on the following fields of study:

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.

Between 2010 and 2021, his most popular works were:

  • 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)

In his most recent research, the most cited papers focused on:

  • 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.

Best Publications

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

Best Scientists Citing David G. Kirkpatrick

Micha Sharir

Micha Sharir

Tel Aviv University

Publications: 76

Leonidas J. Guibas

Leonidas J. Guibas

Stanford University

Publications: 55

Herbert Edelsbrunner

Herbert Edelsbrunner

Institute of Science and Technology Austria

Publications: 53

Timothy M. Chan

Timothy M. Chan

University of Illinois at Urbana-Champaign

Publications: 52

Bernard Chazelle

Bernard Chazelle

Princeton University

Publications: 48

Michael T. Goodrich

Michael T. Goodrich

University of California, Irvine

Publications: 46

Prosenjit Bose

Prosenjit Bose

Carleton University

Publications: 44

Dinesh Manocha

Dinesh Manocha

University of Maryland, College Park

Publications: 44

Ming C. Lin

Ming C. Lin

University of Maryland, College Park

Publications: 43

David Eppstein

David Eppstein

University of California, Irvine

Publications: 40

Mark de Berg

Mark de Berg

Eindhoven University of Technology

Publications: 37

Pankaj K. Agarwal

Pankaj K. Agarwal

Duke University

Publications: 35

Michiel Smid

Michiel Smid

Carleton University

Publications: 34

Jack Snoeyink

Jack Snoeyink

University of North Carolina at Chapel Hill

Publications: 34

Andrew Adamatzky

Andrew Adamatzky

University of the West of England

Publications: 34

Danny Z. Chen

Danny Z. Chen

University of Notre Dame

Publications: 33

Trending Scientists

Stephen V. Hanly

Stephen V. Hanly

Macquarie University

Jianglong Yu

Jianglong Yu

Monash University

Thomas Dobner

Thomas Dobner

Heinrich-Pette-Institute

Manuel Martínez-Bueno

Manuel Martínez-Bueno

University of Granada

Ji-Dong Gu

Ji-Dong Gu

Technion – Israel Institute of Technology

Pim Lindhout

Pim Lindhout

Wageningen University & Research

Owen W. Griffith

Owen W. Griffith

Medical College of Wisconsin

Bassam Ghaleb

Bassam Ghaleb

University of Quebec at Montreal

Henry F. Lamb

Henry F. Lamb

Aberystwyth University

Richard G. J. Bellerby

Richard G. J. Bellerby

East China Normal University

Lucina Q. Uddin

Lucina Q. Uddin

University of California, Los Angeles

Judith Rodin

Judith Rodin

Yale University

Don C. Des Jarlais

Don C. Des Jarlais

New York University

Karel Pavelka

Karel Pavelka

Charles University

Philip Daniel Mauskopf

Philip Daniel Mauskopf

Arizona State University

M. J. Barlow

M. J. Barlow

University College London

Something went wrong. Please try again later.