Raimund Seidel
Raimund Seidel
Professor, Saarland University, Saarbrücken; Saarland Informatics Campus;Schloss Dagstuhl - LZI
確認したメール アドレス: cs.uni-saarland.de
タイトル
引用先
引用先
Handbook of discrete and computational geometry
CD Toth, J O'Rourke, JE Goodman
Chapman and Hall/CRC, 2017
15672017
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
14201983
Constructing arrangements of lines and hyperplanes with applications
H Edelsbrunner, J O’Rourke, R Seidel
SIAM Journal on Computing 15 (2), 341-363, 1986
5841986
The ultimate planar convex hull algorithm?
DG Kirkpatrick, R Seidel
SIAM journal on computing 15 (1), 287-299, 1986
4971986
A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
R Seidel
Computational Geometry 1 (1), 51-64, 1991
4711991
Voronoi diagrams and arrangements
H Edelsbrunner, R Seidel
Discrete & Computational Geometry 1 (1), 25-44, 1986
4251986
How good are convex hull algorithms?
D Avis, D Bremner, R Seidel
Computational Geometry 7 (5-6), 265-301, 1997
3851997
Randomized search trees
R Seidel, CR Aragon
Algorithmica 16 (4-5), 464-497, 1996
3361996
Efficiently computing and representing aspect graphs of polyhedral objects
Z Gigus, J Canny, R Seidel
IEEE Transactions on Pattern Analysis & Machine Intelligence, 542-551, 1991
2971991
Small-dimensional linear programming and convex hulls made easy
R Seidel
Discrete & Computational Geometry 6 (3), 423-434, 1991
2881991
Randomized search trees
CR Aragon, RG Seidel
IEEE, 1989
2761989
On the all-pairs-shortest-path problem in unweighted undirected graphs
R Seidel
Journal of computer and system sciences 51 (3), 400-403, 1995
2621995
Linear programming and convex hulls made easy
R Seidel
Proceedings of the sixth annual symposium on Computational geometry, 211-215, 1990
2301990
Constructing higher-dimensional convex hulls at logarithmic cost per face
R Seidel
Proceedings of the eighteenth annual ACM symposium on Theory of computing …, 1986
2231986
Four results on randomized incremental constructions
KL Clarkson, K Mehlhorn, R Seidel
Computational Geometry 3 (4), 185-212, 1993
2111993
Computing convolutions by reciprocal search
LJ Guibas, R Seidel
Discrete & Computational Geometry 2 (2), 175-193, 1987
2101987
On the difficulty of triangulating three-dimensional nonconvex polyhedra
J Ruppert, R Seidel
Discrete & Computational Geometry 7 (3), 227-253, 1992
1901992
Backwards analysis of randomized geometric algorithms
R Seidel
New trends in discrete and computational geometry, 37-67, 1993
1581993
The nature and meaning of perturbations in geometric computing
R Seidel
Discrete & Computational Geometry 19 (1), 1-17, 1998
1471998
On the all-pairs-shortest-path problem
R Seidel
Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992
1371992
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20