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
[1]
Hilfe
Suche: Author="Aurenhammer, F."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Gray code enumeration of plane straight-line graphs
O. Aichholzer
,
F. Aurenhammer
,
C. Huemer
,
B. Vogtenhuber
Graphs and Combinatorics
23
(5), 2007, pp. 467-479
Farthest line segment Voronoi diagrams
F. Aurenhammer
,
R.L.S. Drysdale
,
H. Krasser
Information Processing Letters
100
(6), 2006, pp. 220-225
Minkowski-type theorems and least-squares clustering
F. Aurenhammer
,
F. Hoffmann
,
B. Aronov
Algorithmica
20
(1), 1998, pp. 61-76
Recognizing binary Hamming graphs in
O(n^2\log n)
time
F. Aurenhammer
,
J. Hagauer
Math. Systems Theory
28
(5), 1995, pp. 387-395
A relationship between Gale transforms and Voronoi diagrams
F. Aurenhammer
Discrete Applied Mathematics
28
, 1990, pp. 83-91
Improved algorithms for discs and balls using power diagrams
F. Aurenhammer
Journal of Algorithms
9
(2), 1988, June, pp. 151-161
Geometric relations among Voronoi diagrams
F. Aurenhammer
,
H. Imai
Lecture Notes in Computer Science
247
, 1987, pp. 53-65
Recognising polytopical cell complexes and constructing projection polyhedra
F. Aurenhammer
Journal Symbolic Computation
3
(3), 1987, pp. 249-255
Power diagrams: properties, algorithms and applications
F. Aurenhammer
SIAM Journal on Computing
16
(1), 1987, February, pp. 78-96
The one-dimensional weighted Voronoi diagram
F. Aurenhammer
Information Processing Letters
22
(3), 1986, March, pp. 119-123