LGS: Geometric constraint solver

Abstract

In the paper we present LGS - a geometric constraint solver developed, at LEDAS Ltd. We review different approaches in geometric constraint solving, present our one, describe in details LGS architecture and the ideas behind it. The main idea of LGS is to decompose the initial problem into a set of simpler ones, to map each instance to a class of problems, and to apply a specialized algorithm to each class. We emphasize key differences of our approach: extendible hierarchy of problem classes, new decomposition techniques, a broad range of numerical algorithms. © Springer-Verlag Berlin Heidelberg 2003.