Raimund Seidel
Raimund Seidel
Professor, Saarland University, Saarbrücken; Saarland Informatics Campus;Schloss Dagstuhl - LZI
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα cs.uni-saarland.de
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
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
17111983
Constructing arrangements of lines and hyperplanes with applications
H Edelsbrunner, J O’Rourke, R Seidel
SIAM Journal on Computing 15 (2), 341-363, 1986
6091986
The ultimate planar convex hull algorithm?
DG Kirkpatrick, R Seidel
SIAM journal on computing 15 (1), 287-299, 1986
5371986
A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
R Seidel
Computational Geometry 1 (1), 51-64, 1991
5011991
Voronoi diagrams and arrangements
H Edelsbrunner, R Seidel
Discrete & Computational Geometry 1 (1), 25-44, 1986
4621986
How good are convex hull algorithms?
D Avis, D Bremner, R Seidel
Computational Geometry 7 (5-6), 265-301, 1997
4031997
Randomized search trees
R Seidel, CR Aragon
Algorithmica 16 (4), 464-497, 1996
3641996
Small-dimensional linear programming and convex hulls made easy
R Seidel
Discrete & Computational Geometry 6 (3), 423-434, 1991
3151991
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
3111991
On the all-pairs-shortest-path problem in unweighted undirected graphs
R Seidel
Journal of computer and system sciences 51 (3), 400-403, 1995
3101995
Randomized search trees
CR Aragon, R Seidel
FOCS 30, 540-545, 1989
3041989
Linear programming and convex hulls made easy
R Seidel
Proceedings of the sixth annual symposium on Computational geometry, 211-215, 1990
2451990
Constructing higher-dimensional convex hulls at logarithmic cost per face
R Seidel
Proceedings of the eighteenth annual ACM symposium on Theory of computing …, 1986
2251986
Four results on randomized incremental constructions
KL Clarkson, K Mehlhorn, R Seidel
Computational Geometry 3 (4), 185-212, 1993
2231993
Computing convolutions by reciprocal search
LJ Guibas, R Seidel
Discrete & Computational Geometry 2 (2), 175-193, 1987
2161987
On the difficulty of triangulating three-dimensional nonconvex polyhedra
J Ruppert, R Seidel
Discrete & Computational Geometry 7 (3), 227-253, 1992
1971992
Backwards analysis of randomized geometric algorithms
R Seidel
New trends in discrete and computational geometry, 37-67, 1993
1671993
The nature and meaning of perturbations in geometric computing
R Seidel
Discrete & Computational Geometry 19 (1), 1-17, 1998
1511998
On the all-pairs-shortest-path problem
R Seidel
Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992
1431992
Approximating the d-dimensional complete Euclidean graph
J Ruppert, R Seidel
Proceedings of the 3rd Canadian Conference on Computational Geometry (CCCG …, 1991
1431991
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20