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
    PublisherSpringer Verlag
    Pages346-357
    Number of pages12
    Volume955
    ISBN (Print)3540602208, 9783540602200
    DOIs
    StatePublished - 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)03029743
    ISSN (Electronic)16113349

    Other

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

    Fingerprint

    Plane Sweep
    Geometric Algorithms
    Sweep
    Experiment
    Experiments
    External Memory
    Random number Generator
    Quantitative Evaluation
    Experimental Study
    Theoretical Analysis
    Intersection
    Internal
    Data storage equipment
    Evaluation
    Costs
    Range of data

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    Chiang, Y. J. (1995). Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. Plane sweep. In Algorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings (Vol. 955, 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

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

    Algorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings. Vol. 955 Springer Verlag, 1995. p. 346-357 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 955).

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

    Chiang, YJ 1995, Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. Plane sweep. in Algorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings. vol. 955, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 955, Springer Verlag, pp. 346-357, 4th Workshop on Algorithms and Data Structures, WADS 1995, Kingston, Canada, 8/16/95. https://doi.org/10.1007/3-540-60220-8_75
    Chiang YJ. Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. Plane sweep. In Algorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings. Vol. 955. Springer Verlag. 1995. p. 346-357. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-60220-8_75
    Chiang, Yi Jen. / Experiments on the practical I/O efficiency of geometric algorithms : Distribution sweep vs. Plane sweep. Algorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings. Vol. 955 Springer Verlag, 1995. pp. 346-357 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{79ec6ae0823c491f9eba38aa4dbff79f,
    title = "Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. Plane sweep",
    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.",
    author = "Chiang, {Yi Jen}",
    year = "1995",
    doi = "10.1007/3-540-60220-8_75",
    language = "English (US)",
    isbn = "3540602208",
    volume = "955",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "346--357",
    booktitle = "Algorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings",

    }

    TY - GEN

    T1 - Experiments on the practical I/O efficiency of geometric algorithms

    T2 - Distribution sweep vs. Plane sweep

    AU - Chiang, Yi Jen

    PY - 1995

    Y1 - 1995

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=21844519976&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=21844519976&partnerID=8YFLogxK

    U2 - 10.1007/3-540-60220-8_75

    DO - 10.1007/3-540-60220-8_75

    M3 - Conference contribution

    AN - SCOPUS:21844519976

    SN - 3540602208

    SN - 9783540602200

    VL - 955

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 346

    EP - 357

    BT - Algorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings

    PB - Springer Verlag

    ER -