The complexity of order type isomorphism

Greg Aloupis, John Iacono, Stefan Langerman, Özgür Özkan, Stefanie Wuhrer

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

    Abstract

    The order type of a point set in Rd maps each (d+1)-tuple of points to its orientation (e.g., clockwise or counterclockwise in R 2). Two point sets X and Y have the same order type if there exists a mapping f from X to Y for which every (d+1 )- Tuple (a1, a 2,..., ad+1) of X and the corresponding tuple (f(a 1), f((a2),..., f(ad+1)) in Y have the same orientation. In this paper we investigate the complexity of determining whether two point sets have the same order type. We provide an O (nd) algorithm for this task, thereby improving upon the O(n[3d/2]) algorithm of Goodman and Pollack (1983). The algorithm uses only order type queries and also works for abstract order types (or acyclic oriented matroids). Our algorithm is optimal, both in the abstract setting and for realizable points sets if the algorithm only uses order type queries.

    Original languageEnglish (US)
    Title of host publicationProceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014
    PublisherAssociation for Computing Machinery
    Pages405-415
    Number of pages11
    ISBN (Print)9781611973389
    StatePublished - 2014
    Event25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014 - Portland, OR, United States
    Duration: Jan 5 2014Jan 7 2014

    Other

    Other25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014
    CountryUnited States
    CityPortland, OR
    Period1/5/141/7/14

    Fingerprint

    Order Type
    Isomorphism
    Point Sets
    Query
    Oriented Matroid
    Anticlockwise
    Clockwise

    ASJC Scopus subject areas

    • Software
    • Mathematics(all)

    Cite this

    Aloupis, G., Iacono, J., Langerman, S., Özkan, Ö., & Wuhrer, S. (2014). The complexity of order type isomorphism. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014 (pp. 405-415). Association for Computing Machinery.

    The complexity of order type isomorphism. / Aloupis, Greg; Iacono, John; Langerman, Stefan; Özkan, Özgür; Wuhrer, Stefanie.

    Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. Association for Computing Machinery, 2014. p. 405-415.

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

    Aloupis, G, Iacono, J, Langerman, S, Özkan, Ö & Wuhrer, S 2014, The complexity of order type isomorphism. in Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. Association for Computing Machinery, pp. 405-415, 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, OR, United States, 1/5/14.
    Aloupis G, Iacono J, Langerman S, Özkan Ö, Wuhrer S. The complexity of order type isomorphism. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. Association for Computing Machinery. 2014. p. 405-415
    Aloupis, Greg ; Iacono, John ; Langerman, Stefan ; Özkan, Özgür ; Wuhrer, Stefanie. / The complexity of order type isomorphism. Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. Association for Computing Machinery, 2014. pp. 405-415
    @inproceedings{e5874ded70344b3d9e03d1927be968d2,
    title = "The complexity of order type isomorphism",
    abstract = "The order type of a point set in Rd maps each (d+1)-tuple of points to its orientation (e.g., clockwise or counterclockwise in R 2). Two point sets X and Y have the same order type if there exists a mapping f from X to Y for which every (d+1 )- Tuple (a1, a 2,..., ad+1) of X and the corresponding tuple (f(a 1), f((a2),..., f(ad+1)) in Y have the same orientation. In this paper we investigate the complexity of determining whether two point sets have the same order type. We provide an O (nd) algorithm for this task, thereby improving upon the O(n[3d/2]) algorithm of Goodman and Pollack (1983). The algorithm uses only order type queries and also works for abstract order types (or acyclic oriented matroids). Our algorithm is optimal, both in the abstract setting and for realizable points sets if the algorithm only uses order type queries.",
    author = "Greg Aloupis and John Iacono and Stefan Langerman and {\"O}zg{\"u}r {\"O}zkan and Stefanie Wuhrer",
    year = "2014",
    language = "English (US)",
    isbn = "9781611973389",
    pages = "405--415",
    booktitle = "Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014",
    publisher = "Association for Computing Machinery",

    }

    TY - GEN

    T1 - The complexity of order type isomorphism

    AU - Aloupis, Greg

    AU - Iacono, John

    AU - Langerman, Stefan

    AU - Özkan, Özgür

    AU - Wuhrer, Stefanie

    PY - 2014

    Y1 - 2014

    N2 - The order type of a point set in Rd maps each (d+1)-tuple of points to its orientation (e.g., clockwise or counterclockwise in R 2). Two point sets X and Y have the same order type if there exists a mapping f from X to Y for which every (d+1 )- Tuple (a1, a 2,..., ad+1) of X and the corresponding tuple (f(a 1), f((a2),..., f(ad+1)) in Y have the same orientation. In this paper we investigate the complexity of determining whether two point sets have the same order type. We provide an O (nd) algorithm for this task, thereby improving upon the O(n[3d/2]) algorithm of Goodman and Pollack (1983). The algorithm uses only order type queries and also works for abstract order types (or acyclic oriented matroids). Our algorithm is optimal, both in the abstract setting and for realizable points sets if the algorithm only uses order type queries.

    AB - The order type of a point set in Rd maps each (d+1)-tuple of points to its orientation (e.g., clockwise or counterclockwise in R 2). Two point sets X and Y have the same order type if there exists a mapping f from X to Y for which every (d+1 )- Tuple (a1, a 2,..., ad+1) of X and the corresponding tuple (f(a 1), f((a2),..., f(ad+1)) in Y have the same orientation. In this paper we investigate the complexity of determining whether two point sets have the same order type. We provide an O (nd) algorithm for this task, thereby improving upon the O(n[3d/2]) algorithm of Goodman and Pollack (1983). The algorithm uses only order type queries and also works for abstract order types (or acyclic oriented matroids). Our algorithm is optimal, both in the abstract setting and for realizable points sets if the algorithm only uses order type queries.

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

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

    M3 - Conference contribution

    SN - 9781611973389

    SP - 405

    EP - 415

    BT - Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014

    PB - Association for Computing Machinery

    ER -