H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 42 Citations 10,663 74 World Ranking 4091 National Ranking 190
Mathematics H-index 41 Citations 9,934 74 World Ranking 947 National Ranking 56

Overview

What is he best known for?

The fields of study he is best known for:

  • Geometry
  • Combinatorics
  • Algorithm

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.

His most cited work include:

  • On the shape of a set of points in the plane (1112 citations)
  • Constructing arrangements of lines and hyperplanes with applications (408 citations)
  • The ultimate planar convex hull algorithm (338 citations)

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

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.

He most often published in these fields:

  • Combinatorics (63.72%)
  • Discrete mathematics (35.40%)
  • Upper and lower bounds (20.35%)

What were the highlights of his more recent work (between 2005-2020)?

  • Combinatorics (63.72%)
  • Discrete mathematics (35.40%)
  • Upper and lower bounds (20.35%)

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

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.

Between 2005 and 2020, his most popular works were:

  • Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons (235 citations)
  • Arrangements of curves in the plane- topology, combinatorics, and algorithms (97 citations)
  • Computing the link center of a simple polygon (64 citations)

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

  • Geometry
  • Algorithm
  • Combinatorics

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.

Top Publications

On the shape of a set of points in the plane

H. Edelsbrunner;D. Kirkpatrick;R. Seidel.
IEEE Transactions on Information Theory (1983)

1495 Citations

Constructing arrangements of lines and hyperplanes with applications

H Edelsbrunner;J O'Rouke;R Seidel.
SIAM Journal on Computing (1986)

607 Citations

The ultimate planar convex hull algorithm

David G Kirkpatrick;Raimund Seidel.
SIAM Journal on Computing (1986)

517 Citations

Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons

Raimund Seidel.
Computational Geometry: Theory and Applications (2010)

503 Citations

Voronoi diagrams and arrangements

Herbert Edelsbrunner;Raimund Seidel.
Discrete and Computational Geometry (1986)

439 Citations

Randomized Search Trees

Raimund Seidel;Raimund Seidel;Cecilia R. Aragon.
Algorithmica (1996)

360 Citations

How good are convex hull algorithms

David Avis;David Bremner;Raimund Seidel;Raimund Seidel.
Computational Geometry: Theory and Applications (1997)

344 Citations

Efficiently computing and representing aspect graphs of polyhedral objects

Z. Gigus;J. Canny;R. Seidel.
IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

316 Citations

Small-dimensional linear programming and convex hulls made easy

Raimund Seidel.
Discrete and Computational Geometry (1991)

312 Citations

On the all-pairs-shortest-path problem in unweighted undirected graphs

Raimund Seidel.
symposium on the theory of computing (1995)

300 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Top Scientists Citing Raimund Seidel

Micha Sharir

Micha Sharir

Tel Aviv University

Publications: 172

Herbert Edelsbrunner

Herbert Edelsbrunner

Institute of Science and Technology Austria

Publications: 70

Bernard Chazelle

Bernard Chazelle

Princeton University

Publications: 62

Boris Aronov

Boris Aronov

New York University

Publications: 54

Emo Welzl

Emo Welzl

ETH Zurich

Publications: 53

Timothy M. Chan

Timothy M. Chan

University of Illinois at Urbana-Champaign

Publications: 53

Dinesh Manocha

Dinesh Manocha

University of Maryland, College Park

Publications: 48

Godfried T. Toussaint

Godfried T. Toussaint

New York University Abu Dhabi

Publications: 41

Kurt Mehlhorn

Kurt Mehlhorn

Max Planck Institute for Informatics

Publications: 40

Pankaj K. Agarwal

Pankaj K. Agarwal

Duke University

Publications: 39

Leonidas J. Guibas

Leonidas J. Guibas

Stanford University

Publications: 38

Michael T. Goodrich

Michael T. Goodrich

University of California, Irvine

Publications: 37

Prosenjit Bose

Prosenjit Bose

Carleton University

Publications: 36

Dan Halperin

Dan Halperin

Tel Aviv University

Publications: 34

Jeff Erickson

Jeff Erickson

University of Illinois at Urbana-Champaign

Publications: 31

Something went wrong. Please try again later.