Combinatorics, Discrete mathematics, Convex hull, Randomized algorithm and Convex combination are his primary areas of study. Raimund Seidel is studying Fortune's algorithm, which is a component of Combinatorics. His Discrete mathematics study combines topics from a wide range of disciplines, such as Shortest path problem and Point location.
His studies deal with areas such as Upper and lower bounds and Convex polytope as well as Convex hull. His Randomized algorithm research integrates issues from Linear programming algorithm, Linear programming, Constant and Regular polygon. His biological study spans a wide range of topics, including Alpha shape, Delaunay triangulation, Shape analysis and Point distribution model.
Raimund Seidel focuses on Combinatorics, Discrete mathematics, Upper and lower bounds, Algorithm and Convex hull. His Combinatorics research includes elements of Voronoi diagram, Set, Convex polytope and Regular polygon. His work in the fields of Polytope and Randomized algorithm overlaps with other areas such as Running time.
The various areas that Raimund Seidel examines in his Upper and lower bounds study include Point set, Bounded function, Constant, Space and Plane. Raimund Seidel interconnects Theoretical computer science, Data structure, Discrete geometry and Rotation in the investigation of issues within Algorithm. His Convex hull research includes themes of Computational geometry, Alpha shape, Convex set and Convex polygon.
His primary areas of investigation include Combinatorics, Discrete mathematics, Upper and lower bounds, Set and Data structure. His Combinatorics study integrates concerns from other disciplines, such as Plane and Convex hull. His studies in Convex hull integrate themes in fields like Subderivative, Convex combination and Convex polytope, Convex analysis.
His Discrete mathematics study incorporates themes from Planar, Line segment and Approximation algorithm. His Upper and lower bounds study also includes
Polyhedron which is related to area like Absolute value, Null vector and Disjoint sets,
Shadow together with Polytope and Connected component. His research on Set also deals with topics like
Point which is related to area like Voronoi diagram,
Algorithm that intertwine with fields like Theoretical computer science and Simple.
Raimund Seidel spends much of his time researching Combinatorics, Discrete mathematics, Set, Enumeration and Line segment. His research in Combinatorics intersects with topics in Algorithm and Plane. His research on Discrete mathematics frequently links to adjacent areas such as Upper and lower bounds.
His Set research is multidisciplinary, incorporating elements of Time complexity and Point. The concepts of his Line segment study are interwoven with issues in Polygonal chain, Connected component and Randomized algorithm. His work carried out in the field of Spanning tree brings together such families of science as Preprocessor, Convex hull, Steiner tree problem, Partition and Data structure.
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.
On the shape of a set of points in the plane
H. Edelsbrunner;D. Kirkpatrick;R. Seidel.
IEEE Transactions on Information Theory (1983)
Constructing arrangements of lines and hyperplanes with applications
H Edelsbrunner;J O'Rouke;R Seidel.
SIAM Journal on Computing (1986)
The ultimate planar convex hull algorithm
David G Kirkpatrick;Raimund Seidel.
SIAM Journal on Computing (1986)
Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
Computational Geometry: Theory and Applications (2010)
Voronoi diagrams and arrangements
Herbert Edelsbrunner;Raimund Seidel.
Discrete and Computational Geometry (1986)
Randomized Search Trees
Raimund Seidel;Raimund Seidel;Cecilia R. Aragon.
How good are convex hull algorithms
David Avis;David Bremner;Raimund Seidel;Raimund Seidel.
Computational Geometry: Theory and Applications (1997)
On the all-pairs-shortest-path problem in unweighted undirected graphs
symposium on the theory of computing (1995)
Small-dimensional linear programming and convex hulls made easy
Discrete and Computational Geometry (1991)
Efficiently computing and representing aspect graphs of polyhedral objects
Z. Gigus;J. Canny;R. Seidel.
IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)
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: