MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named Raimund Seidel – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

23 documents found, showing 1 through 10. Next 10 →

ATOM

Backwards Analysis of Randomized Geometric Algorithms
by Raimund Seidel — 1992 — Trends in Discrete and Computational Geometry, volume 10 of Algorithms and Combinatorics
…Backwards Analysis of Randomized Geometric Algorithms Raimund Seidel Computer Science Division…
Cited by 57 (0 self) – Add To MetaCart

A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons
by Raimund Seidel — 1991 — Comput. Geom. Theory Appl
… and for Triangulating Polygons Raimund Seidel y Computer Science Division University of California Berkeley Berkeley…
Cited by 81 (2 self) – Add To MetaCart

On the all-pairs-shortest-path problem
by Raimund Seidel — 1992 — In ACM STOC
…On the All-Pairs-Shortest-Path Problem RAIMUND SEIDEL* Computer Science Division University…
Cited by 27 (0 self) – Add To MetaCart

On the Exact Worst Case Query Complexity of Planar Point Location
by Udo Adamy, Raimund Seidel — 1998 — In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
…On the Exact Worst Case Query Complexity of Planar Point Location Udo Adamy y Raimund Seidel z…
Cited by 6 (0 self) – Add To MetaCart

A better upper bound on the number of triangulations of a planar point set
by Francisco Santos, Raimund Seidel — 2003 — J. Combin. Theory Ser. A
… OF A PLANAR POINT SET FRANCISCO SANTOS AND RAIMUND SEIDEL Abstract. We show that a point set…
Cited by 19 (2 self) – Add To MetaCart

Better Lower Bounds on Detecting Affine and Spherical Degeneracies
by Jeff Erickson, Raimund Seidel — 1995
… Division University of California Berkeley, CA 94720, USA je e@(email omitted); Abstract Raimund Seidel…
Cited by 23 (8 self) – Add To MetaCart

Maximizing a Voronoi Region: The Convex Case
by Frank Dehne, Rolf Klein, Raimund Seidel — 2005 — In Proc. 13th Annu. Internat. Sympos. Algorithms Comput
…Maximizing a Voronoi Region: The Convex Case Frank Dehne ∗ Rolf Klein † Raimund Seidel ‡ June 16…
Cited by 7 (0 self) – Add To MetaCart

On Compatible Triangulations of Simple Polygons
by Boris Aronov, Raimund Seidel, Diane Souvaine — 1993 — Computational Geometry: Theory and Applications
…, Piscataway, NJ 08855 Raimund Seidel Computer Science Division, University of California, Berkeley, CA 94720…
Cited by 33 (4 self) – Add To MetaCart

How to Net a Lot with Little: Small ε-Nets for Disks and Halfspaces
by Jiri Matousek, Raimund Seidel, Emo Welzl — 2000 — In Proc. 6th Annu. ACM Sympos. Comput. Geom
…@(email omitted); Raimund Seidel Computer Science Division, University of California Berkeley Berkeley CA 94720, USA e…
Cited by 6 (0 self) – Add To MetaCart

David Avis
by School Of, David Avis, David Bremner, Raimund Seidel, Fachberich Informatik — 1997 — Computational Geometry: Theory and Applications
…, CANADA, H3A 2A7 Raimund Seidel y Computer Science Division University of California Berkeley Berkeley CA…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB