作者: Jürgen Bokowski , Bernd Sturmfels
DOI: 10.1007/BF02187702
关键词:
摘要: Several important and hard realizability problems of combinatorial geometry can be reduced to the problem oriented matroids. In this paper we describe a method find coordinatization for large class realizable cases. This algorithm has been used successfully decide several geometric problems. It is shown that all realizations found by our fulfill isotopy property.