Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. Plane sweep

Yi Jen Chiang

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    We present an extensive experimental study comparing the performance of four algorithms for the orthogonal segment intersection problem. The algorithms under evaluation are distribution sweep, which has optimal I/O cost, and three variations of plane sweep, which is optimal in terms of internal computation. We generate the test data by using a random number generator while producing some interesting properties that are predicted by our theoretical analysis. The sizes of the test data range from 250 thousand segments to 2.5 million segments. The experiments provide detailed quantitative evaluation of the performance of the four algorithms. This is the first experimental work comparing the practical performance between external-memory algorithms and conventional algorithms with large-scale test data.

    Original languageEnglish (US)
    Title of host publicationAlgorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings
    EditorsSelim G. Akl, Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro
    PublisherSpringer Verlag
    Pages346-357
    Number of pages12
    ISBN (Print)3540602208, 9783540602200
    DOIs
    StatePublished - Jan 1 1995
    Event4th Workshop on Algorithms and Data Structures, WADS 1995 - Kingston, Canada
    Duration: Aug 16 1995Aug 18 1995

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume955
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other4th Workshop on Algorithms and Data Structures, WADS 1995
    CountryCanada
    CityKingston
    Period8/16/958/18/95

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint Dive into the research topics of 'Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. Plane sweep'. Together they form a unique fingerprint.

  • Cite this

    Chiang, Y. J. (1995). Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. Plane sweep. In S. G. Akl, F. Dehne, J-R. Sack, & N. Santoro (Eds.), Algorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings (pp. 346-357). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 955). Springer Verlag. https://doi.org/10.1007/3-540-60220-8_75