#### Filter Results:

- Full text PDF available (77)

#### Publication Year

1961

2017

- This year (1)
- Last 5 years (15)
- Last 10 years (34)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

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 logarithmic time, with the update requiring fewer than two rotations. Moreover, the update time remains logarithmic, even if the cost of a rotation is taken to be… (More)

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

A generalization of the convex hull of a finite set of points in Akl and Toussaint [ 11, for instance, discuss the relevance the plane is introduced and analyzed. This generalization leads to a family of straight-line graphs, “o-shapes,” which seem to capture the intuitive of the convex hull problem to pattern recognition. By notions of “fine shape” and… (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. This paper presents a very simple incremental randomized algorithm for computing the trapezoidal decomposition induced by a set S of n line segments in the… (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 be on the hull. We also show that this algorithm is asymptotically worst case optimal on a rather realistic model of computation even if the complexity of the… (More)

- Herbert Edelsbrunner, Raimund Seidel
- Discrete & 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 of real valued functions on <italic>D</italic>. Valuable insight can be gained when one considers how these real valued functions partition… (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 polygon corners. Is it always possible to produce compatible triangulations if additional vertices inside the polygon are allowed? We give a positive answer and… (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 shown to improve known worst-case time complexities for five problems: computing all order-k Voronoi diagrams, computing the λ-matrix, estimating halfspace… (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 time O(nln/2l). In both bounds d is considered to be a constant. In the linear programming algorithm the dependence of the time bound on d is of the form d!.… (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 a convex hull. For fixed dimensions our new algorithms have worst case time complexity O(m 2 -tFlogm), where m is the size of the input point set and F is the… (More)