D-Index & Metrics Best Publications

D-Index & Metrics

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
Computer Science D-index 65 Citations 14,673 234 World Ranking 1142 National Ranking 667
Mathematics D-index 59 Citations 13,075 198 World Ranking 269 National Ranking 143

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Artificial intelligence
  • Geometry

His primary areas of study are Combinatorics, Approximation algorithm, Algorithm, Shortest path problem and K shortest path routing. His studies deal with areas such as Discrete mathematics and Regular polygon as well as Combinatorics. His Regular polygon research includes themes of Polygon mesh, Polygon, Invariant, Star-shaped polygon and Computation.

His work carried out in the field of Approximation algorithm brings together such families of science as Point, Travelling salesman problem, Theoretical computer science and Computational geometry. The concepts of his Algorithm study are interwoven with issues in Routing, Artificial intelligence, Rendering, Volume rendering and Ray tracing. His Mathematical optimization research is multidisciplinary, incorporating perspectives in Geometric networks, Path and Wireless sensor network.

His most cited work include:

  • Efficient collision detection using bounding volume hierarchies of k-DOPs (765 citations)
  • An efficiently computable metric for comparing polygonal shapes (572 citations)
  • The discrete geodesic problem (544 citations)

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

His scientific interests lie mostly in Combinatorics, Approximation algorithm, Algorithm, Discrete mathematics and Plane. His Combinatorics study combines topics in areas such as Upper and lower bounds, Point and Polygon. His Approximation algorithm study which covers Path that intersects with Link.

His Discrete mathematics research integrates issues from Matching, Delaunay triangulation and K shortest path routing. His Plane research includes elements of Binary logarithm and Line segment. As a member of one scientific family, Joseph S. B. Mitchell mostly works in the field of Time complexity, focusing on Computational geometry and, on occasion, Regular polygon.

He most often published in these fields:

  • Combinatorics (49.62%)
  • Approximation algorithm (19.85%)
  • Algorithm (18.83%)

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

  • Combinatorics (49.62%)
  • Approximation algorithm (19.85%)
  • Plane (13.23%)

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

His primary scientific interests are in Combinatorics, Approximation algorithm, Plane, Point and Discrete mathematics. The study incorporates disciplines such as Travelling salesman problem and Line segment in addition to Combinatorics. His research in Approximation algorithm intersects with topics in Wireless sensor network, Optimization problem, Covering problems and Cover.

He interconnects Binary logarithm, Path, The Intersect and Scheme in the investigation of issues within Plane. Within one scientific family, Joseph S. B. Mitchell focuses on topics pertaining to Algorithm under Point, and may sometimes address concerns connected to Link. Joseph S. B. Mitchell usually deals with Discrete mathematics and limits it to topics linked to Matching and Structure, Simply connected space, Relaxation and Integer programming.

Between 2014 and 2021, his most popular works were:

  • Approximation algorithms for TSP with neighborhoods in the plane (60 citations)
  • An algorithm for the maximum weight independent set problem on outerstring graphs (26 citations)
  • Bichromatic 2-center of pairs of points (20 citations)

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

  • Algorithm
  • Artificial intelligence
  • Geometry

His main research concerns Combinatorics, Approximation algorithm, Point, Wireless sensor network and Plane. His work on Disjoint sets as part of his general Combinatorics study is frequently connected to Generalization, thereby bridging the divide between different branches of science. Joseph S. B. Mitchell focuses mostly in the field of Approximation algorithm, narrowing it down to matters related to Covering problems and, in some cases, Partition and The Intersect.

The Point study combines topics in areas such as Class and Visibility. His work in Wireless sensor network covers topics such as Distributed computing which are related to areas like Anonymity and Node. His Plane research incorporates themes from Binary logarithm, Path and Line segment.

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

Efficient collision detection using bounding volume hierarchies of k-DOPs

J.T. Klosowski;M. Held;J.S.B. Mitchell;H. Sowizral.
IEEE Transactions on Visualization and Computer Graphics (1998)

1289 Citations

An efficiently computable metric for comparing polygonal shapes

E.M. Arkin;L.P. Chew;D.P. Huttenlocher;K. Kedem.
IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

1018 Citations

The discrete geodesic problem

Joseph S. B. Mitchell;David M. Mount;Christos H. Papadimitriou.
SIAM Journal on Computing (1987)

743 Citations

Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k -MST, and Related Problems

Joseph S. B. Mitchell.
SIAM Journal on Computing (1999)

532 Citations

Boundary recognition in sensor networks by topological methods

Yue Wang;Jie Gao;Joseph S.B. Mitchell.
acm/ieee international conference on mobile computing and networking (2006)

486 Citations

The weighted region problem: finding shortest paths through a weighted planar subdivision

Joseph S. B. Mitchell;Christos H. Papadimitriou.
Journal of the ACM (1991)

387 Citations

Approximation algorithms for lawn mowing and milling

Esther M. Arkin;Sándor P. Fekete;Joseph S. B. Mitchell.
Computational Geometry: Theory and Applications (2000)

285 Citations

SHORTEST PATHS AMONG OBSTACLES IN THE PLANE

Joseph S.B. Mitchell.
International Journal of Computational Geometry and Applications (1996)

229 Citations

Evaluation of Collision Detection Methods for Virtual Reality Fly-Throughs

Martin Held;J.T. Klosowski;J.S.B. Mitchell.
(1995)

228 Citations

BOXTREE: A Hierarchical Representation for Surfaces in 3D

Gill Barequet;Bernard Chazelle;Leonidas J. Guibas;Joseph S.B. Mitchell.
Computer Graphics Forum (1996)

226 Citations

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

Contact us

Best Scientists Citing Joseph S. B. Mitchell

Erik D. Demaine

Erik D. Demaine

MIT

Publications: 67

Danny Z. Chen

Danny Z. Chen

University of Notre Dame

Publications: 63

Pankaj K. Agarwal

Pankaj K. Agarwal

Duke University

Publications: 62

Dinesh Manocha

Dinesh Manocha

University of Maryland, College Park

Publications: 54

Micha Sharir

Micha Sharir

Tel Aviv University

Publications: 50

Stephen G. Kobourov

Stephen G. Kobourov

University of Arizona

Publications: 43

Jie Gao

Jie Gao

Rutgers, The State University of New Jersey

Publications: 40

Ming C. Lin

Ming C. Lin

University of Maryland, College Park

Publications: 40

Subhash Suri

Subhash Suri

University of California, Santa Barbara

Publications: 39

Sariel Har-Peled

Sariel Har-Peled

University of Illinois at Urbana-Champaign

Publications: 38

David Eppstein

David Eppstein

University of California, Irvine

Publications: 38

Mark de Berg

Mark de Berg

Eindhoven University of Technology

Publications: 36

Ying He

Ying He

Nanyang Technological University

Publications: 36

Marc van Kreveld

Marc van Kreveld

Utrecht University

Publications: 35

Joachim Gudmundsson

Joachim Gudmundsson

University of Sydney

Publications: 35

Boris Aronov

Boris Aronov

New York University

Publications: 32

Trending Scientists

Herbert A. Mang

Herbert A. Mang

TU Wien

Joris van Slageren

Joris van Slageren

University of Stuttgart

Tianbo Liu

Tianbo Liu

University of Akron

Rafael Radi

Rafael Radi

University of the Republic

Richard N. Dixon

Richard N. Dixon

University of Bristol

Rainer Schmid-Fetzer

Rainer Schmid-Fetzer

Clausthal University of Technology

Xiuli Wang

Xiuli Wang

Zhejiang University

Avner Rothschild

Avner Rothschild

Technion – Israel Institute of Technology

King Wai Yau

King Wai Yau

Johns Hopkins University School of Medicine

Cesare Peschle

Cesare Peschle

Istituto Superiore di Sanità

Trond Ryberg

Trond Ryberg

University of Potsdam

Albert A. Presto

Albert A. Presto

Carnegie Mellon University

Shu-Chen Li

Shu-Chen Li

TU Dresden

Serge Brand

Serge Brand

University of Basel

James E. Ysseldyke

James E. Ysseldyke

University of Minnesota

Ralph R. Weichselbaum

Ralph R. Weichselbaum

University of Chicago

Something went wrong. Please try again later.