Algorithms and Data Structures : Workshop WADS '89, Ottawa, Canada, August 17-19, 1989. Proceedings. 1st ed. 1989

種類:

電子ブック

責任表示:

edited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1989

著者名:

• Dehne, Frank.
• Sack, Jörg-Rüdiger.
• Santoro, Nicola.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 382

ISBN:

9783540482376 [3540482377]    

注記:

Efficient text searching of regular expressions -- Efficient spatial point location -- Constructing the Voronoi diagram of a set of line segments in parallel -- Analysis of kdt-trees: Kd-trees improved by local reorganisations -- Optimal algorithms for List Indexing and Subset Rank -- The Delaunay triangulation closely approximates the complete Euclidean graph -- Computing the furthest site voronoi diagram for a set of discs -- Fully persistent arrays -- String searching algorithms revisited -- Optimal channel placement for multi-terminal nets -- Computing the minimum visible vertex distance between two polygons -- Computing the kernel of a point set in a polygon -- Using bounded degree spanning trees in the design of efficient algorithms on claw-free graphs -- Linear time algorithms for computing reachability regions from polygonal figures -- Computing the center of area of a polygon -- Weighted orthogonal linear L ?-approximation and applications -- Discs and other related data structures -- Digital data st
This book contains the papers presented at the 1989 Workshop on Algorithms and Data Structures, which succeeds the 1988 Scandinavian Workshop on Algorithm Theory. It presents current research in various areas of algorithms, computational geometry, geometric searching, VLSI placement and routing, graph algorithms, parallel algorithms, distributed algorithms, databases, and text searching.

ローカル注記:

学内専用E-BOOKS (local access only)