Convexity in Discrete Space
- 991 Downloads
This paper looks at Coppel’s axioms for convexity, and shows how they can be applied to discrete spaces. Two structures for a discrete geometry are considered: oriented matroids, and cell complexes. Oriented matroids are shown to have a structure which naturally satisfies the axioms for being a convex geometry. Cell complexes are shown to give rise to various different notions of convexity, one of which satisfies the convexity axioms, but the others also provide valid notions of convexity in particular contexts. Finally, algorithms are investigated to validate the sets of a matroid, and to compute the convex hull of a subset of an oriented matroid.
KeywordsConvexity axioms alignment spaces affine spaces convex spaces convex hull discrete geometry oriented matroids cell complexes matroid algorithms
Unable to display preview. Download preview PDF.
- BLS+99.Björner, A., Las Vergnas, M., Sturmfels, B., White, N., Ziegler, G.: Oriented Matroids. Encyclopedia of Mathematics and its Applications, vol. 46. CUP (1999)Google Scholar
- dvOS99.de Berg, M., van Krevald, M., Overmars, M., Schwarzkopf, O.: Computational Geometry Algorithms and Applications. Springer, Heidelberg (1999)Google Scholar
- Kov89 .
- Kov92.Kovalevsky, V.A.: Finite topology and image analysis. Advances in Electronics and Electron Physics 84, 197–259 (1992)Google Scholar
- Ste00.Stell, J.G.: The representation of discrete multi-resolution spatial knowledge. In: Cohn, A.G., Giunchiglia, F., Selman, B. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of KR 2000, pp. 38–49. Morgan Kaufmann, San Francisco (2000)Google Scholar
- von75 .
- Web94.Roger Webster. Convexity. OUP (1994)Google Scholar
- Webar.Webster, J.: Cell complexes, oriented matroids and digital geometry. Theoretical Computer Science (to appear)Google Scholar
- Win95.Winter, S.: Topological relations between discrete regions. LNCS, vol. 951, pp. 310–327 (1995)Google Scholar