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="Toussaint, Godfried T."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Flat-state connectivity of linkages under dihedral motions
Greg Aloupis
,
Erik D. Demaine
,
Vida Dujmović
,
Jeff Erickson
,
Stefan Langerman
,
Henk Meijer
,
Joseph O'Rourke
,
Mark Overmars
,
Michael Soss
,
Ileana Streinu
,
Godfried T. Toussaint
Lecture Notes in Computer Science
2518
, 2002, pp. 369-380
Pattern recognition
Joseph O'Rourke
,
Godfried T. Toussaint
Handbook of Discrete and Computational Geometry, 1997, pp. 797-813
Finding Hamiltonian circuits in arrangements of Jordan curves is NP-complete
Chuzo Iwamoto
,
Godfried T. Toussaint
Information Processing Letters
52
, 1994, pp. 183-189
A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible
Binary K. Bhattacharya
,
Asish Mukhopadhyay
,
Godfried T. Toussaint
Lecture Notes in Computer Science
519
, 1991, pp. 412-424
Translating polygons in the plane
Jörg R. Sack
,
Godfried T. Toussaint
Lecture Notes in Computer Science
182
, 1985, pp. 310-321
Efficient algorithms for computing the maximum distance between two finite planar sets
Binay K. Bhattacharya
,
Godfried T. Toussaint
Journal of Algorithms
4
, 1983, pp. 121-136
Feature evaluation with quadratic mutual information
Godfried T. Toussaint
Information Processing Letters
1
, 1971, pp. 153-156