Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 1989

Algorithms and Data Structures

Workshop WADS '89, Ottawa, Canada, August 17-19, 1989. Proceedings

Editors:

  1. F. Dehne
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. J. -R. Sack
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. N. Santoro
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 382)

Sections

Buy it now

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (49 papers)

  1. Front Matter

    PDF

  2. Efficient text searching of regular expressions

    • Ricardo A. Baeza-Yates, Gaston H. Gonnet
    Pages 1-2

  3. Efficient spatial point location

    • Franco P. Preparata, Roberto Tamassia
    Pages 3-11

  4. Constructing the Voronoi diagram of a set of line segments in parallel

    • Michael T. Goodrich, Colm Ó'Dúnlaing, Chee K. Yap
    Pages 12-23

  5. Analysis of kdt-trees: Kd-trees improved by local reorganisations

    • Walter Cunto, Gustavo Lau, Philippe Flajolet
    Pages 24-38

  9. Fully persistent arrays

    • Paul F. Dietz
    Pages 67-74

  10. String searching algorithms revisited

    • Ricardo A. Baeza-Yates
    Pages 75-96

  11. Optimal channel placement for multi-terminal nets

    • Mikhail J. Atallah, Susanne E. Hambrusch
    Pages 97-114

  12. Computing the minimum visible vertex distance between two polygons

    • Alok Aggarwal, Shlomo Moran, Peter W. Shor, Subhash Suri
    Pages 115-134

  13. Computing the kernel of a point set in a polygon

    • Yan Ke, Joseph O'Rourke
    Pages 135-146

  16. Computing the center of area of a polygon

    • Matthew Díaz, Joseph O'Rourke
    Pages 171-182

  17. Weighted orthogonal linear L ∞-approximation and applications

    • Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert
    Pages 183-191

  18. Discs and other related data structures

    • Fabrizio Luccio, Mireille Régnier, René Schott
    Pages 192-205

  19. Digital data structures and order statistics

    • Wojciech Szpankowski
    Pages 206-217

  20. On the performance of orthogonal range queries in multiattribute and doubly chained trees

    • Danièle Gardy, Philippe Flajolet, Claude Puech
    Pages 218-229
Back to top

About this book

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.
Back to top

Keywords

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Search

Navigation