Umwege in Polygonen - Universität Bonn

Literatur
[AERT92] A. Aggarwal, H. Edelsbrunner, P. Raghavan, and P. Tiwari. Optimal time
bounds for some proximity problems in the plane. Inform. Process. Lett.,
42(1):55–60, 1992.
[AHNR98]
[AKKS02]
Andersson, Hagerup, Nilsson, and Raman. Sorting in linear time? J. Comput.
Syst. Sci., 57:74–93, 1998.
Pankaj K. Agarwal, Rolf Klein, Christian Knauer, and Micha Sharir. Computing
the detour of polygonal curves. Technical report, Freie Universität Berlin,
Fachbereich Mathematik und Informatik, 2002.
[Bos93] Karl Bosch. Mathematik-Taschenbuch. R. Oldenbourg Verlag, München, 4.
edition, 1993.
[BSMM95]
I. N. Bronstein, K. A. Semendjajew, G. Musiol, and H. Mühlig. Taschenbuch
der Mathematik. Verlag Harry Deutsch, Frankfurt am Main, 2. edition, 1995.
[Cha91] Bernard Chazelle. Triangulating a simple polygon in linear time. Discrete
Comput. Geom., 6(5):485–524, 1991.
[Che96] Jianer Chen. Computational geometry: Methods and applications.
Lecture notes, Computer Science Department, Texas A&M University,
http://faculty.cs.tamu.edu/chen/notes/geo.pdf, 1996.
[CSSS89]
[DK84]
R. Cole, J. Salowe, W. Steiger, and E. Szemerédi. An optimal-time algorithm
for slope selection. SIAM J. Comput., 18(4):792–810, 1989.
S. Reisch D. Kirkpatrick. Upper bounds for sorting integers on random access
machines. Theoret. Comput. Sci., 28:263–276, 1984.
[DL79] D. P. Dobkin and R. J. Lipton. On the complexity of computations under
varying sets of primitives. J. Comput. Syst. Sci., 18:86–91, 1979.
[EBKLL01] Annette Ebbers-Baumann, Rolf Klein, Elmar Langetepe, and Andrzej Lingas.
A fast algorithm for approximating the detour of a polygonal chain. ESA 2001
- European Symposium on Algorithms, 2001.
[EH97]
[Fis95]
[FW90]
[FW93]
David Eppstein and Daniel S. Hirschberg. Choosing subsets with maximum
weighted average. J. Algorithms, 24(1):177–193, 1997.
Gerd Fischer. Lineare Algebra. vieweg, Braunschweig/Wiesbaden, 10. edition,
1995.
F. W. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum
spanning trees and shortest paths. In Proc. 31st Annu. IEEE Sympos. Found.
Comput. Sci., pages 719–725, 1990.
F. W. Fredman and D. E. Willard. Surpassing the information theoretic bound
with fusion trees. J. Comput. Syst. Sci., 48(3):424–436, 1993.
[GH87] Leonidas J. Guibas and J. Hershberger. Optimal shortest path queries in a
simple polygon. In Proc. 3rd Annu. ACM Sympos. Comput. Geom., pages 50–
63, 1987.
[GHL + 87]
Leonidas J. Guibas, J. Hershberger, D. Leven, Micha Sharir, and R. E. Tarjan.
Linear-time algorithms for visibility and shortest path problems inside
triangulated simple polygons. Algorithmica, 2:209–233, 1987.
83