On the coordinatization of oriented matroids

Several important and hard realizability problems of combinatorial geometry can be reduced to the realizability problem of oriented matroids. In this paper we describe a method to find a coordinatization for a large class of realizable cases. This algorithm has been used successfully to decide several geometric realizability problems. It is shown that all realizations found by our algorithm fulfill the isotopy property.