Raimund Seidel

Q: What Schools Are Affiliated With Raimund Seidel

Raimund Seidel is affiliated with the following schools: Saarland University, University of California, Berkeley, IBM Research – Almaden, Cornell University, University of Tübingen

Raimund Seidel's AcademicInfluence.com Rankings

Raimund Seidel

Computer Science

#789

World Rank

#816

Historical Rank

Database

#7267

World Rank

#7521

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Raimund Seidel Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Raimund G. Seidel is a German and Austrian theoretical computer scientist and an expert in computational geometry. Seidel was born in Graz, Austria, and studied with Hermann Maurer at the Graz University of Technology. He received his M. Sc. in 1981 from University of British Columbia under David G. Kirkpatrick. He received his Ph.D. in 1987 from Cornell University under the supervision of John Gilbert. After teaching at the University of California, Berkeley, he moved in 1994 to Saarland University. In 1997 he and Christoph M. Hoffmann were program chairs for the Symposium on Computational Geometry. In 2014, he took over as Scientific Director of the Leibniz Center for Informatics from Reinhard Wilhelm.

(See a Problem?)

Raimund Seidel's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

On the shape of a set of points in the plane (1983) (1584)
Constructing arrangements of lines and hyperplanes with applications (1983) (508)
Randomized search trees (1989) (434)
The Ultimate Planar Convex Hull Algorithm? (1986) (408)
Voronoi diagrams and arrangements (1985) (366)
On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs (1995) (283)
Small-dimensional linear programming and convex hulls made easy (1991) (260)
A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons (1991) (252)
Efficiently Computing And Representing Aspect Graphs Of Polyhedral Objects (1988) (219)
Linear programming and convex hulls made easy (1990) (208)
Four Results on Randomized Incremental Constructions (1992) (203)
Constructing higher-dimensional convex hulls at logarithmic cost per face (1986) (180)
On the difficulty of triangulating three-dimensional Nonconvex Polyhedra (1992) (162)
Computing convolutions by reciprocal search (1986) (161)
The Nature and Meaning of Perturbations in Geometric Computing (1994) (140)
Backwards Analysis of Randomized Geometric Algorithms (1993) (135)
How to net a lot with little: small ε-nets for disks and halfspaces (1990) (125)
On Compatible Triangulations of Simple Polygons (1993) (114)
Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms (2018) (111)
On the all-pairs-shortest-path problem (1992) (111)
On the Zone Theorem for Hyperplane Arrangements (1991) (110)
A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions (1981) (102)
Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons (2010) (94)
A New Method for Solving Constraint Satisfaction Problems (1981) (92)
Checking geometric programs or verification of geometric structures (1996) (90)
The Upper Bound Theorem for Polytopes: an Easy Proof of Its Asymptotic Version (1995) (86)
Computing the link center of a simple polygon (2011) (80)
Counting and cutting cycles of lines and rods in space (1990) (78)
On the exact computation of the topology of real algebraic curves (2005) (76)
Convex Hull Computations (2004) (71)
Output-size sensitive algorithms for finding maximal vectors (1985) (67)
On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra (1989) (65)
A better upper bound on the number of triangulations of a planar point set (2002) (64)
Efficient Perturbations for Handling Geometric Degeneracies (1997) (52)
Implicitly representing arrangements of lines or segments (2011) (51)
Exact Upper Bounds for the Number of Faces in d-Dimensional Voronoi Diagrams (1990) (50)
Better lower bounds on detecting affine and spherical degeneracies (1993) (49)
Results on k-sets and j-facets via continuous motion (1998) (47)
On the Number of Cycles in Planar Graphs (2007) (46)
On the exact worst case query complexity of planar point location (2000) (45)
Top-Down Analysis of Path Compression (2005) (42)
A Method for Proving Lower Bounds for Certain Geometric Problems (1984) (36)
Output-Size Sensitive Algorithms For Constructive Problems In Computational Geometry (1987) (35)
Some methods of computational geometry applied to computer graphics (1984) (33)
Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms (1988) (33)
Maximizing a Voronoi Region: the Convex Case (2002) (32)
On arrangements of Jordan arcs with three intersections per pair (2018) (27)
Simple On-Line Algorithms for Convex Polygons (1985) (25)
On the number of faces in higher-dimensional Voronoi diagrams (1987) (25)
A simple aggregative algorithm for counting triangulations of planar point sets and related problems (2013) (23)
Finding the optimal shadows of a convex polytope (1985) (22)
Selecting Heavily Covered Points (1994) (20)
Lower bounds for fundamental geometric problems (1996) (18)
Slimming down by adding; selecting heavily covered points (1990) (17)
A simple and less slow method for counting triangulations and for related problems (2004) (17)
Algorithm Explanation: Visualizing Abstract States and Invariants (2001) (16)
Note – On the Number of Triangulations of Planar Point Sets (1998) (14)
New lower bounds for the number of straight-edge triangulations of a planar point set (2004) (11)
Counting triangulations and other crossing-free structures approximately (2014) (11)
On the Complexity of Achieving K-Consistency (1983) (9)
Determining an aesthetic inscribed curve (2012) (9)
Algorithm animation using shape analysis: visualising abstract executions (2005) (9)
On the complexity of umbra and penumbra (2009) (9)
Understanding the Inverse Ackermann Function (2006) (8)
Data-specific analysis of string sorting (2010) (8)
Convex hulls of spheres and convex hulls of disjoint convex polytopes (2013) (6)
Average curve of n smooth planar curves (2016) (5)
On Computing the Centroid of the Vertices of an Arrangement and Related Problems (2007) (5)
Proofs with potential (1993) (4)
Inserting One Edge into a Simple Drawing is Hard (2019) (4)
A Tail Estimate for Mulmuley's Segment Intersection Algorithm (1992) (4)
Algorithm visualization using concrete and abstract shape graphs (2008) (4)
Counting Triangulations Approximately (2013) (3)
Extending simple drawings with one edge is hard (2019) (3)
Between umbra and penumbra (2007) (3)
Cache-Oblivious Dynamic Dictionaries with Optimal Update / Query Tradeo (2010) (3)
Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric (2010) (2)
Results on -Sets and -Facets via Continuous Motion (1997) (2)
Teaching Computational Geometry (1993) (2)
Developments in Data Structure Research During the First 25 Years of FSTTCS (2005) (1)
Lower Bounding the Number of Straight-Edge Triangulations of Planar Point Sets (2003) (1)
Teaching Computational Geometry, II (2009) (1)
Errata: Better Lower Bounds on Detecting A ne and Spherical Degeneracies (1999) (1)
On Arrangement of Jordan Arcs with Three Intersection per Pair (1989) (1)
Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices (2005) (1)
Weak and Strong ε-Nets for Geometric Range Spaces (2009) (1)
Approximating the Minimum Spanning Tree of Set of Points in the Hausdorff Metric (2008) (0)
Computational Geometry (Dagstuhl Seminar 99102) (2021) (0)
Computational Geometry (Dagstuhl Seminar 9511) (2021) (0)
Book List for Algorithms and Data Structures Summer 2008 (2008) (0)
Results on -facets via continuous motion (1998) (0)
Counting Straight-Edge Tringulation of Planar Point Sets (2005) (0)
The Influence of Dimensions on the Complexity of Computing Decision Trees (2022) (0)
Computational Geometry (Dagstuhl Seminar 9707) (2021) (0)
1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA (2018) (0)
Can Nearest Neighbor Searching Be Simple and Always Fast? (2011) (0)
Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily) (2006) (0)
Randomized Median-of-Three Trees (2013) (0)
Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, CA, USA, June 6-8, 1990 (1990) (0)
26 CONVEX HULL COMPUTATIONS (2017) (0)
Maintaining Ideally Distributed Random Search Trees without Extra Space (2009) (0)
Approximation of Minimum Spanning Trees of Set of Points in the Hausdorff Metric (2007) (0)
10091 Abstracts Collection - Data Structures (2004) (0)
On the Shape o f a Set o f Points in the Plane (0)
Chapter 10. Challenges in Algorithm Engineering (0)
Data Structures and Algorithms (Summer 2008) Contents (2008) (0)

This paper list is powered by the following services:

Other Resources About Raimund Seidel

en.wikipedia.org

What Schools Are Affiliated With Raimund Seidel?

Raimund Seidel is affiliated with the following schools: