#### Filter Results:

- Full text PDF available (67)

#### Publication Year

1958

2017

- This year (1)
- Last 5 years (11)
- Last 10 years (31)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Cecilia R. Aragon, Raimund Seidel
- Algorithmica
- 1989

We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimalexpected behavior. In particular, in the expected case a search or an update takesâ€¦ (More)

- Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel
- IEEE Trans. Information Theory
- 1983

ACKNOWLEDGMENT The authors express their appreciation for numerous constructive suggestions, which led to improvements on various phases of the manuscript, to Dr. A high performance multiple dataâ€¦ (More)

- Raimund Seidel
- Comput. Geom.
- 1991

Seidel, R., A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons, Computational Geometry: Theory and Applications 1 (1991) 51-64.â€¦ (More)

- David G. Kirkpatrick, Raimund Seidel
- SIAM J. Comput.
- 1986

We present a new planar convex hull algorithm with worst case time complexity O(n log H) where n is the size of the input set and H is the size of the output set, i.e. the number of vertices found toâ€¦ (More)

- Raimund Seidel
- J. Comput. Syst. Sci.
- 1995

- Boris Aronov, Raimund Seidel, Diane L. Souvaine
- Comput. Geom.
- 1993

It is well known that, given two simple n-sided polygons, it may not be possible to triangulate the two polygons in a compatible fashion, if one's choice of triangulation vertices is restricted toâ€¦ (More)

- Herbert Edelsbrunner, Raimund Seidel
- Symposium on Computational Geometry
- 1985

We propose a uniform and general framework for defining and dealing with Voronoi Diagrams. In this framework a Voronoi Diagram is a partition of a domain <italic>D</italic> induced by a finite numberâ€¦ (More)

- Raimund Seidel
- Discrete & Computational Geometry
- 1991

We present two randomized algorithms. One solves linear programs involving m constraints in d variables in expected time O(m). The other constructs convex hulls of n points in Nd, d > 3, in expectedâ€¦ (More)

- Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel
- 24th Annual Symposium on Foundations of Computerâ€¦
- 1983

An optimal algorithm is presented for constructing an arrangement of hyperplanes in arbitrary dimensions. It relies on a combinatorial result that is of interest in its own right. The algorithm isâ€¦ (More)

- Raimund Seidel
- STOC
- 1986

We exhibit a new approach for dealing with higher dimensional convex hull problems, such as enumerating all facets of the convex hull of a finite point set or constructing the facial lattice of suchâ€¦ (More)