The Complexity of Order Type Isomorphism
From MaRDI portal
Publication:5383989
DOI10.1137/1.9781611973402.30zbMath1422.68099arXiv1311.0928OpenAlexW4211045450MaRDI QIDQ5383989
Özgür Özkan, John Iacono, Stefan Langerman, Greg Aloupis, Stefanie Wuhrer
Publication date: 20 June 2019
Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.0928
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Data structures (68P05)
Related Items
Drawing the almost convex set in an integer grid of minimum size, Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees, Clique-width of point configurations, Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees, Subquadratic Encodings for Point Configurations