Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Guibas, L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A method for obtaining randomized algorithms with small tail probablities
H. Alt
,
L. Guibas
,
K. Mehlhorn
,
R. Karp
,
A. Wigderson
Algorithmica
16
, 1996, pp. 543-547
Lines in space: Combinatorics and algorithms
B. Chazelle
,
H. Edelsbrunner
,
L.J. Guibas
,
M. Sharir
,
J. Stolfi
Algorithmica
15
, 1996, pp. 428-447
Ray shooting in polygons using geodesic triangulations
B. Chazelle
,
H. Edelsbrunner
,
M. Grigni
,
L. Guibas
,
J. Hershberger
,
M. Sharir
,
J. Snoeyink
Algorithmica
12
(1), 1994, pp. 54-68
A method for obtaining randomized algorithms with small tail probabilities
H. Alt
,
L. Guibas
,
K. Mehlhorn
,
R. Karp
,
Avi Wigderson
Technical Report (1992-29), 1992
The number of edges of many faces in a line segment arrangement
B. Aronov
,
H. Edelsbrunner
,
L.J. Guibas
,
M. Sharir
Combinatorica
12
, 1992, pp. 261-274
Ray shooting in polygons using geodesic triangulations
B. Chazelle
,
H. Edelsbrunner
,
M. Grigni
,
L. Guibas
,
J. Hershberger
,
M. Sharir
,
J. Snoeyink
Lecture Notes in Computer Science
510
, 1991, pp. 661-673
Counting and cutting cycles of lines and rods in space
B. Chazelle
,
H. Edelsbrunner
,
L.J. Guibas
,
R. Pollack
,
R. Seidel
,
M. Sharir
,
J. Snoeyink
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~I, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 242-251
A singly-exponential stratification scheme for real semi-algebraic varieties and its applications
B. Chazelle
,
H. Edelsbrunner
,
L.J. Guibas
,
M. Sharir
Lecture Notes in Computer Science
372
, 1989, pp. 179-193
Parallel computational geometry
A. Aggarwal
,
B. Chazelle
,
L. Guibas
,
C. O'DĂșnlaing
,
C. Yap
Algorithmica
3
, 1988, pp. 293-327
Combinatorial complexity bounds for arrangements of curves and surfaces
K.L. Clarkson
,
H. Edelsbrunner
,
L.J. Guibas
,
M. Sharir
,
E. Welzl
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 568-579
Arrangements of curves in the plane - topology, combinatorics, and algorithms
H. Edelsbrunner
,
L. Guibas
,
J. Pach
,
R. Pollack
,
R. Seidel
,
M. Sharir
Lecture Notes in Computer Science
317
, 1988, pp. 214-229
Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques
L. Guibas
,
M. Overmars
,
M. Sharir
Lecture Notes in Computer Science
318
, 1988, pp. 64-73
An
O(n^2)
shortest path algorithm for a non-rotating convex body
J. Hershberger
,
L.J. Guibas
Journal of Algorithms
9
(1), 1988, March, pp. 18-46
A linear time algorithm for computing the Voronoi diagram of a convex polygon
A. Aggarwal
,
L. Guibas
,
J. Saxe
,
P. Shor
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 39-45
The complexity of cutting convex polytopes
B. Chazelle
,
H. Edelsbrunner
,
L. Guibas
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 66-76
Optimal point location in a monotone subdivision
H. Edelsbrunner
,
L.J. Guibas
,
J. Stolfi
SIAM Journal on Computing
15
(2), 1986, May, pp. 317-340
Topologically sweeping an arrangement
H. Edelsbrunner
,
L.J. Guibas
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC'86 (Berkeley, CA, May 28-30, 1986)
, 1986, pp. 389-403
Probabilistic analysis of a network resource allocation algorithm
N.A. Lynch
,
N.D. Griffeth
,
M.J. Fischer
,
L.J. Guibas
Information and Control
68
(1-3), 1986, pp. 47-85
Parallel computational geometry
A. Aggarwal
,
B. Chazelle
,
L. Guibas
,
C. O'DĂșnlaing
,
C. Yap
Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, FOCS'85 (Portland, OR, October 21-23, 1985)
, 1985, pp. 468-477
Visibility-polygon search and Euclidean shortest paths
Ta. Asano
,
Te. Asano
,
L. Guibas
,
J. Hershberger
,
H. Imai
Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, FOCS'85 (Portland, OR, October 21-23, 1985)
, 1985, pp. 155-164
Finding extremal polygons
J.E. Boyce
,
D.P. Dobkin
,
R.L. Drysdale III
,
L.J. Guibas
SIAM Journal on Computing
14
(1), 1985, February, pp. 134-147
Fractional cascading: A data structuring technique with geometric applications
B. Chazelle
,
L.J. Guibas
Lecture Notes in Computer Science
194
, 1985, pp. 90-100
Optimal point location in a monotone subdivision
H. Edelsbrunner
,
L.J. Guibas
,
J. Stolfi
Technical Report, 1984, October
The power ofgeometric duality
B. Chazelle
,
L.J. Guibas
,
D.T. Lee
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83 (Tucson, AZ, November 7-9, 1983)
, 1983, pp. 217-225
A kinetic framework for computational geometry
L. Guibas
,
L. Ramshaw
,
J. Stolfi
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83 (Tucson, AZ, November 7-9, 1983)
, 1983, pp. 100-111
Seiten 1
2
>