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 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.
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.
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.
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)
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)
The discrete geodesic problem
Joseph S. B. Mitchell;David M. Mount;Christos H. Papadimitriou.
SIAM Journal on Computing (1987)
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)
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)
The weighted region problem: finding shortest paths through a weighted planar subdivision
Joseph S. B. Mitchell;Christos H. Papadimitriou.
Journal of the ACM (1991)
Approximation algorithms for lawn mowing and milling
Esther M. Arkin;Sándor P. Fekete;Joseph S. B. Mitchell.
Computational Geometry: Theory and Applications (2000)
SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
Joseph S.B. Mitchell.
International Journal of Computational Geometry and Applications (1996)
Evaluation of Collision Detection Methods for Virtual Reality Fly-Throughs
Martin Held;J.T. Klosowski;J.S.B. Mitchell.
BOXTREE: A Hierarchical Representation for Surfaces in 3D
Gill Barequet;Bernard Chazelle;Leonidas J. Guibas;Joseph S.B. Mitchell.
Computer Graphics Forum (1996)
If you think any of the details on this page are incorrect, let us know.
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: