The complexity of order type isomorphism
From MaRDI portal
Publication:6624165
DOI10.1007/S00454-024-00687-1MaRDI QIDQ6624165
Greg Aloupis, Özgür Özkan, Stefan Langerman, Stefanie Wuhrer, John Iacono
Publication date: 25 October 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coding and counting arrangements of pseudolines
- Semispaces of configurations, cell complexes of arrangements
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
- On the combinatorial classification of nondegenerate configurations in the plane
- The complexity of point configurations
- Geometric medians
- Axioms and hulls
- Better lower bounds on detecting affine and spherical degeneracies
- On the problem of aspects.
- Enumerating order types for small point sets with applications
- On n-ordered sets and order completeness
- On the identification of the convex hull of a finite set of points in the plane
- Multidimensional Sorting
- On the convex layers of a planar set
- There are asymptotically far fewer polytopes than we thought
- The number of polytopes, configurations and real matroids
- Constructing Arrangements of Lines and Hyperplanes with Applications
- On the Zone Theorem for Hyperplane Arrangements
- Oriented Matroids
- Abstract order type extension and new results on the rectilinear crossing number
This page was built for publication: The complexity of order type isomorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6624165)
