Reconstructing Point Set Order Typesfrom Radial Orderings
We consider the problem of reconstructing the combinatorial structure of a set of \(n\) points in the plane given partial information on the relative position of the points. This partial information consists of the radial ordering, for each of the \(n\) points, of the \(n-1\) other points around it. We show that this information is sufficient to reconstruct the chirotope, or labeled order type, of the point set, provided its convex hull has size at least four. Otherwise, we show that there can be as many as \(n-1\) distinct chirotopes that are compatible with the partial information, and this bound is tight. Our proofs yield polynomial-time reconstruction algorithms. These results provide additional theoretical insights on previously studied problems related to robot navigation and visibility-based reconstruction.
KeywordsPolynomial Time Convex Hull Radial System Local Sequence Order Type
Unable to display preview. Download preview PDF.
- 3.Björner, A., Las Vergnas, M., Sturmfels, B., White, N., Ziegler, G.: Oriented Matroids, 2nd edn. Cambridge University Press (1999)Google Scholar
- 6.Felsner, S.: On the number of arrangements of pseudolines. In: Proceedings of the Twelfth Annual Symposium on Computational Geometry, pp. 30–37. ACM (1996)Google Scholar
- 8.Pilz, A., Welzl, E.: Order on order-types. In preparationGoogle Scholar
- 15.Durocher, S., Mehrabi, S., Mondal, D., Skala, M.: Realizing site permutations. In: CCCG. (2011)Google Scholar
- 16.Cardinal, J., Kusters, V.: The complexity of simultaneous geometric graph embedding. CoRR abs/1302.7127 (2013)Google Scholar