팔로우
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
23611983
Constructing arrangements of lines and hyperplanes with applications
H Edelsbrunner, J O’Rourke, R Seidel
SIAM Journal on Computing 15 (2), 341-363, 1986
6981986
The ultimate planar convex hull algorithm?
DG Kirkpatrick, R Seidel
SIAM journal on computing 15 (1), 287-299, 1986
6071986
A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
R Seidel
Computational Geometry 1 (1), 51-64, 1991
5591991
Voronoi diagrams and arrangements
H Edelsbrunner, R Seidel
Proceedings of the first annual symposium on Computational geometry, 251-262, 1985
5541985
How good are convex hull algorithms?
D Avis, D Bremner
Proceedings of the eleventh annual symposium on Computational geometry, 20-28, 1995
5001995
Randomized search trees
R Seidel, CR Aragon
Algorithmica 16 (4), 464-497, 1996
4261996
On the all-pairs-shortest-path problem in unweighted undirected graphs
R Seidel
Journal of computer and system sciences 51 (3), 400-403, 1995
3911995
Small-dimensional linear programming and convex hulls made easy
R Seidel
Discrete & Computational Geometry 6, 423-434, 1991
3661991
Randomized search trees
CR Aragon, R Seidel
FOCS 30, 540-545, 1989
3391989
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
3211991
Linear programming and convex hulls made easy
R Seidel
Proceedings of the sixth annual symposium on Computational geometry, 211-215, 1990
2531990
Constructing higher-dimensional convex hulls at logarithmic cost per face
R Seidel
Proceedings of the eighteenth annual ACM symposium on Theory of computing …, 1986
2391986
Four results on randomized incremental constructions
KL Clarkson, K Mehlhorn, R Seidel
Computational Geometry 3 (4), 185-212, 1993
2361993
Computing convolutions by reciprocal search
L Guibas, R Seidel
Proceedings of the second annual symposium on Computational geometry, 90-99, 1986
2251986
On the difficulty of triangulating three-dimensional nonconvex polyhedra
J Ruppert, R Seidel
Discrete & Computational Geometry 7 (3), 227-253, 1992
2051992
Backwards analysis of randomized geometric algorithms
R Seidel
New trends in discrete and computational geometry, 37-67, 1993
1801993
Approximating the d-dimensional complete Euclidean graph
J Ruppert, R Seidel
Proceedings of the 3rd Canadian Conference on Computational Geometry (CCCG …, 1991
1661991
The nature and meaning of perturbations in geometric computing
R Seidel
Discrete & Computational Geometry 19, 1-17, 1998
1651998
On the all-pairs-shortest-path problem
R Seidel
Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992
1641992
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20