Seguir
Raimund Seidel
Raimund Seidel
Professor, Saarland University, Saarbrücken; Saarland Informatics Campus;Schloss Dagstuhl - LZI
Dirección de correo verificada de cs.uni-saarland.de
Título
Citado por
Citado por
Año
On the shape of a set of points in the plane
H Edelsbrunner, D Kirkpatrick, R Seidel
IEEE Transactions on information theory 29 (4), 551-559, 1983
21681983
Constructing arrangements of lines and hyperplanes with applications
H Edelsbrunner, J O’Rourke, R Seidel
SIAM Journal on Computing 15 (2), 341-363, 1986
6671986
The ultimate planar convex hull algorithm?
DG Kirkpatrick, R Seidel
SIAM journal on computing 15 (1), 287-299, 1986
6001986
A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
R Seidel
Computational Geometry 1 (1), 51-64, 1991
5361991
Voronoi diagrams and arrangements
H Edelsbrunner, R Seidel
Proceedings of the first annual symposium on Computational geometry, 251-262, 1985
5301985
How good are convex hull algorithms?
D Avis, D Bremner
Proceedings of the eleventh annual symposium on Computational geometry, 20-28, 1995
4711995
Randomized search trees
R Seidel, CR Aragon
Algorithmica 16 (4), 464-497, 1996
4091996
On the all-pairs-shortest-path problem in unweighted undirected graphs
R Seidel
Journal of computer and system sciences 51 (3), 400-403, 1995
3701995
Small-dimensional linear programming and convex hulls made easy
R Seidel
Discrete & Computational Geometry 6, 423-434, 1991
3531991
Randomized search trees
CR Aragon, R Seidel
FOCS 30, 540-545, 1989
3291989
Efficiently computing and representing aspect graphs of polyhedral objects
Z Gigus, J Canny, R Seidel
IEEE Transactions on Pattern Analysis and Machine Intelligence 13 (6), 542-551, 1991
3141991
Linear programming and convex hulls made easy
R Seidel
Proceedings of the sixth annual symposium on Computational geometry, 211-215, 1990
2491990
Four results on randomized incremental constructions
KL Clarkson, K Mehlhorn, R Seidel
Computational Geometry 3 (4), 185-212, 1993
2361993
Constructing higher-dimensional convex hulls at logarithmic cost per face
R Seidel
Proceedings of the eighteenth annual ACM symposium on Theory of computing …, 1986
2351986
Computing convolutions by reciprocal search
L Guibas, R Seidel
Proceedings of the second annual symposium on Computational geometry, 90-99, 1986
2241986
On the difficulty of triangulating three-dimensional nonconvex polyhedra
J Ruppert, R Seidel
Discrete & Computational Geometry 7 (3), 227-253, 1992
2041992
Backwards analysis of randomized geometric algorithms
R Seidel
New trends in discrete and computational geometry, 37-67, 1993
1771993
The nature and meaning of perturbations in geometric computing
R Seidel
Discrete & Computational Geometry 19, 1-17, 1998
1621998
On the all-pairs-shortest-path problem
R Seidel
Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992
1611992
Approximating the d-dimensional complete Euclidean graph
J Ruppert, R Seidel
Proceedings of the 3rd Canadian Conference on Computational Geometry (CCCG …, 1991
1601991
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20