What is he best known for?
The fields of study he is best known for:
- Algorithm
- Geometry
- Combinatorics
His main research concerns Combinatorics, Computational geometry, Plane, Discrete mathematics and Algorithm.
His Combinatorics study incorporates themes from Simple, Line segment, Binary number and R+ tree.
He combines subjects such as Computational model, Order and Computational resource with his study of Computational geometry.
The Plane study combines topics in areas such as Space, Fixed point and Computer graphics, Hidden surface determination.
His Discrete mathematics study combines topics from a wide range of disciplines, such as Positive weight, Cartogram and Regular polygon.
His work on Analysis of algorithms as part of general Algorithm study is frequently linked to Subdivision, bridging the gap between disciplines.
His most cited work include:
- Computational Geometry: Algorithms and Applications (4130 citations)
- Computational geometry : algorithms and applications (1225 citations)
- Realistic input models for geometric algorithms (111 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of study are Combinatorics, Discrete mathematics, Plane, Algorithm and Regular polygon.
The study incorporates disciplines such as Point, Computational geometry and Constant in addition to Combinatorics.
As a part of the same scientific family, he mostly works in the field of Discrete mathematics, focusing on Partition and, on occasion, Rectangle.
His Plane study integrates concerns from other disciplines, such as Space, Simple, Unit and Approximation algorithm.
His Algorithm study focuses mostly on Efficient algorithm and Computation.
His biological study spans a wide range of topics, including Travelling salesman problem and Monotone polygon.
He most often published in these fields:
- Combinatorics (66.78%)
- Discrete mathematics (32.52%)
- Plane (18.18%)
What were the highlights of his more recent work (between 2014-2021)?
- Combinatorics (66.78%)
- Discrete mathematics (32.52%)
- Constant (9.79%)
In recent papers he was focusing on the following fields of study:
Mark de Berg mostly deals with Combinatorics, Discrete mathematics, Constant, Plane and Algorithm.
His work carried out in the field of Combinatorics brings together such families of science as Upper and lower bounds, Point and Rectangle.
His Vertex study in the realm of Discrete mathematics connects with subjects such as Ask price.
His Plane study also includes fields such as
- Perimeter and related Computational geometry,
- Current, which have a strong connection to Square.
Computational geometry is closely attributed to Convex hull in his study.
His study on Matching is often connected to Straight path as part of broader study in Algorithm.
Between 2014 and 2021, his most popular works were:
- Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons (36 citations)
- Fine-grained complexity analysis of two classic TSP variants (17 citations)
- Separating bichromatic point sets by L-shapes (12 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Artificial intelligence
- Geometry
Mark de Berg mainly investigates Combinatorics, Discrete mathematics, Constant, Time complexity and Dimension.
His Combinatorics study combines topics in areas such as Upper and lower bounds, Point, Convex hull, Cluster analysis and Plane.
His Plane research includes elements of Computational geometry and Perimeter.
Computational geometry is closely attributed to Exact algorithm in his work.
His research in Discrete mathematics intersects with topics in Geometric networks, Distance, Surface and Algebraic number.
In his study, which falls under the umbrella issue of Intersection, Algorithm, Matching, Exponential time hypothesis and Embedding is strongly linked to Independent set.
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.
