What is he best known for?
The fields of study he is best known for:
- Artificial intelligence
- Geometry
- Algorithm
Marc van Kreveld mainly investigates Algorithm, Combinatorics, Time complexity, Point and Computational geometry.
His Algorithm research integrates issues from Simple, Theoretical computer science and Median.
The concepts of his Combinatorics study are interwoven with issues in Discrete mathematics, Set and Regular polygon.
Marc van Kreveld has included themes like Plane, Approximation algorithm, Minimum bounding box algorithms and Closest pair of points problem in his Point study.
His Computational geometry research includes elements of Computational model and Computational resource.
His work on Robotics is typically connected to Local feature size as part of general Artificial intelligence study, connecting several disciplines of science.
His most cited work include:
- Computational Geometry: Algorithms and Applications (4130 citations)
- Computational geometry : algorithms and applications (1225 citations)
- Contour trees and small seed sets for isosurface traversal (292 citations)
What are the main themes of his work throughout his whole career to date?
Marc van Kreveld focuses on Combinatorics, Discrete mathematics, Algorithm, Set and Time complexity.
The various areas that Marc van Kreveld examines in his Combinatorics study include Plane, Regular polygon, Simple polygon, Point and Line segment.
His studies in Discrete mathematics integrate themes in fields like Path, Upper and lower bounds and Approximation algorithm.
His work on Computational geometry, Computation and Delaunay triangulation as part of general Algorithm study is frequently connected to Subdivision, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them.
His study in Set is interdisciplinary in nature, drawing from both Structure, Square, Group and Data structure.
His work deals with themes such as Binary logarithm, Line and Constant, which intersect with Time complexity.
He most often published in these fields:
- Combinatorics (49.82%)
- Discrete mathematics (24.18%)
- Algorithm (19.05%)
What were the highlights of his more recent work (between 2014-2021)?
- Combinatorics (49.82%)
- Set (17.58%)
- Time complexity (16.12%)
In recent papers he was focusing on the following fields of study:
Marc van Kreveld mainly focuses on Combinatorics, Set, Time complexity, Constant and Upper and lower bounds.
When carried out as part of a general Combinatorics research project, his work on Hausdorff space is frequently linked to work in Colored, therefore connecting diverse disciplines of study.
His Set research is multidisciplinary, relying on both Group, Distribution and Matching, Algorithm, Approximation algorithm.
Particularly relevant to Efficient algorithm is his body of work in Algorithm.
His Upper and lower bounds research is multidisciplinary, incorporating elements of Discrete mathematics, Structure and Plane.
His research in Computational geometry intersects with topics in Voronoi diagram and Computational science.
Between 2014 and 2021, his most popular works were:
- Ecological validity of virtual environments to assess human navigation ability (37 citations)
- Segmentation of Trajectories on Nonmonotone Criteria (18 citations)
- Improved Grid Map Layout by Point Set Matching (18 citations)
In his most recent research, the most cited papers focused on:
- Artificial intelligence
- Geometry
- Algorithm
Marc van Kreveld spends much of his time researching Combinatorics, Discrete mathematics, Set, Group and Structure.
His Combinatorics research incorporates themes from Space, Line and Subsequence.
His work in Discrete mathematics covers topics such as Simple polygon which are related to areas like Constant and Geodesic.
As part of one scientific family, Marc van Kreveld deals mainly with the area of Set, narrowing it down to issues related to the Theoretical computer science, and often Computational geometry and Computation.
His Structure research focuses on Upper and lower bounds and how it connects with Plane, Exact algorithm, Computational topology and Inflection point.
Other disciplines of study, such as Binary logarithm and Algorithm, are mixed together with his Long period studies.
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.
