Raimund Seidel

Citado por

	Total	Desde 2015
Citas	11590	2687
Índice h	46	22
Índice i10	73	39

500

250

125

375

19851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202038 35 51 111 91 129 203 243 232 266 223 279 276 298 294 327 240 286 318 398 358 416 430 480 444 427 446 406 467 491 423 491 441 475 443 398

Coautores

David KirkpatrickProfessor of Computer Science, University of British ColumbiaDirección de correo verificada de cs.ubc.ca
Leonidas GuibasProfessor of Computer Science, Stanford UniversityDirección de correo verificada de cs.stanford.edu
Joseph O'RourkeProfessor of Computer Science, Smith CollegeDirección de correo verificada de smith.edu
John CannyUniversity of California, BerkeleyDirección de correo verificada de cs.berkeley.edu
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusDirección de correo verificada de mpi-inf.mpg.de
Janos PachEcole Polytechnique Federale de Lausanne and Renyi Institute BudapestDirección de correo verificada de renyi.hu
Cecilia AragonProfessor of Human Centered Design & Engineering, University of WashingtonDirección de correo verificada de uw.edu
Jack SnoeyinkComputer Science, UNC Chapel HillDirección de correo verificada de cs.unc.edu
Boris AronovProfessor of Computer Science, Tandon School of Engineering, New York UniversityDirección de correo verificada de nyu.edu
Victor AlvarezResearch Associate at TU BraunschweigDirección de correo verificada de victoralvarez.net
Saurabh RayNYU Abu DhabiDirección de correo verificada de nyu.edu
Diane SouvaineProfessor of Computer Science & Vice Provost for Research, Tufts UniversityDirección de correo verificada de tufts.edu
Ioannis EmirisProfessor, Dept Informatics & Telecommunications, National and Kapodistrian University of AthensDirección de correo verificada de di.uoa.gr
Jeff EricksonProfessor of Computer Science, University of Illinois, Urbana-ChampaignDirección de correo verificada de illinois.edu
Francisco SantosProfessor of Mathematics, Universidad de CantabriaDirección de correo verificada de unican.es
Reinhard WilhelmComputer Science, Saarland University, Saarland Informatics Campus (SIC)Dirección de correo verificada de cs.uni-saarland.de
Sariel Har-PeledProfessor of Computer Science, UIUCDirección de correo verificada de uiuc.edu
Artur AndrzejakProfessor of Computer Science, Heidelberg UniversityDirección de correo verificada de informatik.uni-heidelberg.de
Rolf KleinProfessor für Informatik, Universität BonnDirección de correo verificada de uni-bonn.de
Subhash SuriProfessor of Computer Science, University of California, Santa BarbaraDirección de correo verificada de cs.ucsb.edu

Raimund Seidel

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

Dirección de correo verificada de cs.uni-saarland.de

Algorithms Data Structures Computational Geometry Combinatorial Geometry Randomization


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
Handbook of discrete and computational geometry CD Toth, J O'Rourke, JE Goodman CRC press, 2017	1660	2017
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	1493	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	595	1986
The ultimate planar convex hull algorithm? DG Kirkpatrick, R Seidel SIAM journal on computing 15 (1), 287-299, 1986	505	1986
A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons R Seidel Computational Geometry 1 (1), 51-64, 1991	473	1991
Voronoi diagrams and arrangements H Edelsbrunner, R Seidel Discrete & Computational Geometry 1 (1), 25-44, 1986	431	1986
How good are convex hull algorithms? D Avis, D Bremner, R Seidel Computational Geometry 7 (5-6), 265-301, 1997	388	1997
Randomized search trees R Seidel, CR Aragon Algorithmica 16 (4-5), 464-497, 1996	344	1996
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	306	1991
Small-dimensional linear programming and convex hulls made easy R Seidel Discrete & Computational Geometry 6 (3), 423-434, 1991	296	1991
Randomized search trees CR Aragon, R Seidel FOCS 30, 540-545, 1989	282	1989
On the all-pairs-shortest-path problem in unweighted undirected graphs R Seidel Journal of computer and system sciences 51 (3), 400-403, 1995	273	1995
Linear programming and convex hulls made easy R Seidel Proceedings of the sixth annual symposium on Computational geometry, 211-215, 1990	231	1990
Constructing higher-dimensional convex hulls at logarithmic cost per face R Seidel Proceedings of the eighteenth annual ACM symposium on Theory of computing …, 1986	220	1986
Computing convolutions by reciprocal search LJ Guibas, R Seidel Discrete & Computational Geometry 2 (2), 175-193, 1987	215	1987
Four results on randomized incremental constructions KL Clarkson, K Mehlhorn, R Seidel Computational Geometry 3 (4), 185-212, 1993	212	1993
On the difficulty of triangulating three-dimensional nonconvex polyhedra J Ruppert, R Seidel Discrete & Computational Geometry 7 (3), 227-253, 1992	193	1992
Backwards analysis of randomized geometric algorithms R Seidel New trends in discrete and computational geometry, 37-67, 1993	157	1993
The nature and meaning of perturbations in geometric computing R Seidel Discrete & Computational Geometry 19 (1), 1-17, 1998	149	1998
On the all-pairs-shortest-path problem R Seidel Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992	137	1992

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Subir PDF

Seguir a este autor

Citado por

Coautores