Algorithms and Computation
Subtitle: 7th International Symposium, ISAAC '96, Osaka, Japan, December 16 - 18, 1996, Proceedings (Lecture Notes in Computer Science)
Contributors: Tetsuo Asano (Editor); Yoshihide Igarashi (Editor); Hiroshi Nagamochi (Editor); Satoru Miyano (Editor); Subhash Suri (Editor)
Edition: 1 edition
Publisher: Springer
Published: December 19, 1996
Language: eng
Format: Paperback
Number of pages: 448
ISBN-13: 9783540620488
Subjects: Mathematical theory of computation; Programming - General; Computer Graphics - General; Algorithms (Computer Programming); Theory Of Computing; Computers; Computers - General Information; Networking - General; Computer Books: General; Computer Science; Algorithmische Geometrie; Computers / Computer Science; Graph-Algorithmen; Kombinatorik; Komplexitätstheorie; Netzwerkbetrieb; combinatorics; complexity theory; computational geometry; graph algorithms
First sentence: The problem of computing paths that avoid obstacles is fundamental in computational geometry and has many applications.