IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v71y1997i0p259-28910.1023-a1018971515573.html
   My bibliography  Save this article

Data structures for topological and geometric operations on networks

Author

Listed:
  • N. Christofides
  • H.O. Badra
  • Y.M. Sharaiha

Abstract

The growing interest in computer graphics and Geographical Information Systems has made it necessary to develop efficient data structures and algorithmic procedures for handling graphical information in real-time. In this paper, we consider the problem of storage and manipulation of large-scale networks which can undergo dynamic changes. Two complementary data structures are presented: a topological and a topographical representa-tion. The objective is to support both graph-theoretic and geometric operations efficiently. A topological representation facilitates the implementation of graph-theoretic optimization algorithms such as the shortest path and spanning tree problems. In this context, a new dynamic forward star structure is developed and contrasted with the classic (static) forward star representation of sparse graphs. Algorithmic procedures and complexity analysis for network editing operations of this structure are provided. A topographical representation is necessary for geometric operations such as nearest neighbour location and range retrieval. Algorithms for performing editing and geometric operations on the BD-tree are presented. Finally, the practical efficiency of the data structures is investigated by computational experiments on large-scale road networks. Copyright Kluwer Academic Publishers 1997

Suggested Citation

  • N. Christofides & H.O. Badra & Y.M. Sharaiha, 1997. "Data structures for topological and geometric operations on networks," Annals of Operations Research, Springer, vol. 71(0), pages 259-289, January.
    • Handle: RePEc:spr:annopr:v:71:y:1997:i:0:p:259-289:10.1023/a:1018971515573
    DOI: 10.1023/A:1018971515573
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018971515573
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018971515573?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:71:y:1997:i:0:p:259-289:10.1023/a:1018971515573. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.