Raimund Seidel

Citat de

	Toate	Din 2020
Referințe bibliografice	12179	2189
h-index	46	17
i10-index	76	27

480

240

120

360

198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202540 59 117 115 161 220 248 237 262 249 280 272 278 246 280 202 220 271 334 306 311 355 410 364 325 360 331 408 422 365 440 457 414 361 399 428 433 407 480 40

Acces public

Afișați-le pe toate

5 articole

0 articole

disponibile

indisponibile

Pe baza cerințelor privind finanțarea

Coautori

David KirkpatrickProfessor of Computer Science, University of British ColumbiaAdresă de e-mail confirmată pe cs.ubc.ca
Leonidas GuibasProfessor of Computer Science, Stanford UniversityAdresă de e-mail confirmată pe cs.stanford.edu
John CannyUniversity of California, BerkeleyAdresă de e-mail confirmată pe cs.berkeley.edu
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusAdresă de e-mail confirmată pe mpi-inf.mpg.de
Cecilia AragonProfessor, University of WashingtonAdresă de e-mail confirmată pe uw.edu
Boris AronovProfessor of Computer Science, Tandon School of Engineering, New York UniversityAdresă de e-mail confirmată pe nyu.edu
Janos PachEcole Polytechnique Federale de Lausanne and Renyi Institute BudapestAdresă de e-mail confirmată pe renyi.hu
Jack SnoeyinkComputer Science, UNC Chapel HillAdresă de e-mail confirmată pe cs.unc.edu
Joseph O'RourkeProfessor of Computer Science, Smith CollegeAdresă de e-mail confirmată pe smith.edu
Victor AlvarezResearch Associate at TU BraunschweigAdresă de e-mail confirmată pe victoralvarez.net
Ioannis EmirisAthena Research Center; and National & Kapodistrian University of AthensAdresă de e-mail confirmată pe di.uoa.gr
Diane SouvaineProfessor of Computer Science & Vice Provost for Research, Tufts UniversityAdresă de e-mail confirmată pe tufts.edu
Saurabh RayNYU Abu DhabiAdresă de e-mail confirmată pe nyu.edu
Jeff EricksonProfessor of Computer Science, University of Illinois Urbana-ChampaignAdresă de e-mail confirmată pe illinois.edu
Francisco SantosProfessor of Mathematics, Universidad de CantabriaAdresă de e-mail confirmată pe unican.es
Reinhard WilhelmComputer Science, Saarland University, Saarland Informatics Campus (SIC)Adresă de e-mail confirmată pe cs.uni-saarland.de
Sariel Har-PeledProfessor of Computer Science, UIUCAdresă de e-mail confirmată pe uiuc.edu
Artur AndrzejakProfessor of Computer Science, Heidelberg UniversityAdresă de e-mail confirmată pe informatik.uni-heidelberg.de
Christian KnauerInstitut für Informatik, Universität BayreuthAdresă de e-mail confirmată pe uni-bayreuth.de
Kevin BuchinProfessor of Computer Science, Technical University DortmundAdresă de e-mail confirmată pe tu-dortmund.de

Urmăriți

Raimund Seidel

Professor, Saarland University, Saarbrücken; Saarland Informatics Campus;Schloss Dagstuhl - LZI

Adresă de e-mail confirmată pe cs.uni-saarland.de

Algorithms Data Structures Computational Geometry Combinatorial Geometry Randomization


Titlu Sortați după descrierea bibliografică Sortați după an Sortați după titlu	Citat de Citat de	Anul
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	2341	1983
Constructing arrangements of lines and hyperplanes with applications H Edelsbrunner, J O’Rourke, R Seidel SIAM Journal on Computing 15 (2), 341-363, 1986	685	1986
The ultimate planar convex hull algorithm? DG Kirkpatrick, R Seidel SIAM journal on computing 15 (1), 287-299, 1986	616	1986
Voronoi diagrams and arrangements H Edelsbrunner, R Seidel Proceedings of the first annual symposium on Computational geometry, 251-262, 1985	551	1985
A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons R Seidel Computational Geometry 1 (1), 51-64, 1991	548	1991
How good are convex hull algorithms? D Avis, D Bremner Proceedings of the eleventh annual symposium on Computational geometry, 20-28, 1995	495	1995
Randomized search trees R Seidel, CR Aragon Algorithmica 16 (4), 464-497, 1996	421	1996
On the all-pairs-shortest-path problem in unweighted undirected graphs R Seidel Journal of computer and system sciences 51 (3), 400-403, 1995	389	1995
Small-dimensional linear programming and convex hulls made easy R Seidel Discrete & Computational Geometry 6, 423-434, 1991	359	1991
Randomized search trees CR Aragon, R Seidel FOCS 30, 540-545, 1989	338	1989
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	319	1991
Linear programming and convex hulls made easy R Seidel Proceedings of the sixth annual symposium on Computational geometry, 211-215, 1990	253	1990
Four results on randomized incremental constructions KL Clarkson, K Mehlhorn, R Seidel Computational Geometry 3 (4), 185-212, 1993	237	1993
Constructing higher-dimensional convex hulls at logarithmic cost per face R Seidel Proceedings of the eighteenth annual ACM symposium on Theory of computing …, 1986	236	1986
Computing convolutions by reciprocal search L Guibas, R Seidel Proceedings of the second annual symposium on Computational geometry, 90-99, 1986	229	1986
On the difficulty of triangulating three-dimensional nonconvex polyhedra J Ruppert, R Seidel Discrete & Computational Geometry 7 (3), 227-253, 1992	209	1992
Backwards analysis of randomized geometric algorithms R Seidel New trends in discrete and computational geometry, 37-67, 1993	175	1993
Approximating the d-dimensional complete Euclidean graph J Ruppert, R Seidel Proceedings of the 3rd Canadian Conference on Computational Geometry (CCCG …, 1991	164	1991
The nature and meaning of perturbations in geometric computing R Seidel Discrete & Computational Geometry 19, 1-17, 1998	162	1998
On the all-pairs-shortest-path problem R Seidel Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992	162	1992

Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.

Articole 1–20

Referințe bibliografice pe an

Citate duplicat

Citate fuzionate

Adăugați coautoriCoautori

Urmăriți

Citat de

Coautori