Schewe L (2006)
Publication Status: Published
Publication Type: Book chapter / Article in edited volumes
Publication year: 2006
Publisher: Springer
Edited Volumes: Mathematical Software - ICMS 2006
Series: Lecture Notes in Computer Science
City/Town: Berlin, Heidelberg
Book Volume: 4151
Pages Range: 216-218
Event location: Castro Urdiales
ISBN: 9783540380849
DOI: 10.1007/11832225_19
Oriented matroids are a combinatorial abstraction of finite sets of points in ℝ n . They have been used to study various problems in discrete and computational geometry (for more material on oriented matroids, see [1,2]). A number of methods to generate oriented matroids have been proposed (for instance in [4,8-10]) as these methods can be used as a building block for the algorithmic treatment of some hard problems: Algorithms to generate oriented matroids have for instance been used to decide whether certain 4-polytopes exist [6,10,14]. For these questions it is important to have effective algorithms for the generation of oriented matroids. We propose to use satisfiability solvers to generate oriented matroids. We have adapted this approach to generate oriented matroids that satisfy certain geometric constraints. Even though one can use the generated oriented matroids as a first step to find realizations (see for instance [2,6]), we will only focus on non-realizability results.
APA:
Schewe, L. (2006). Generation of oriented matroids using satisfiability solvers. In Andrés Iglesias, Nobuki Takayama (Eds.), Mathematical Software - ICMS 2006. (pp. 216-218). Berlin, Heidelberg: Springer.
MLA:
Schewe, Lars. "Generation of oriented matroids using satisfiability solvers." Mathematical Software - ICMS 2006. Ed. Andrés Iglesias, Nobuki Takayama, Berlin, Heidelberg: Springer, 2006. 216-218.
BibTeX: Download