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="Dobkin, David P."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Implementing a general-purpose edge router
David P. Dobkin
,
Emden R. Gansner
,
Eleftherios Koutsofios
,
Stephen C. North
Lecture Notes in Computer Science
1353
, 1998, pp. 262-271
Applied computational Geometry
David P. Dobkin
Lecture Notes in Computer Science
1272
, 1997, pp. 185-185
Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning
David P. Dobkin
,
Dimitrios Gunopulos
,
Wolfgang Maass
Journal of Computer and System Sciences
52
(3), 1996, pp. 453-470
Searching for empty convex polygons
David P. Dobkin
,
Herbert Edelsbrunner
,
Mark H. Overmars
Algorithmica
5
, 1990, pp. 561-571
Determining the separation of preprocessed polyhedra
David P. Dobkin
,
David G. Kirkpatrick
Lecture Notes in Computer Science
443
, 1990, pp. 400-413
Computational geometry in a curved world
David P. Dobkin
,
Diane L. Souvaine
Algorithmica
5
, 1990, pp. 421-457
Primitives for the manipulation of three-dimensional subdivisions
David P. Dobkin
,
Michael J. Laszlo
Algorithmica
4
(1), 1989, pp. 3-32
Partitioning space for range queries
F. Frances Yao
,
David P. Dobkin
,
Herbert Edelsbrunner
,
Michael S. Paterson
SIAM Journal on Computing
18
(2), 1989, April, pp. 371-384
Decomposition and intersection of simple splinegons
David P. Dobkin
,
Diane L. Souvaine
,
Christoper J. van Wyk
Algorithmica
3
, 1988, pp. 473-485