Description

Geometric constraints are present in many areas such as CAD, robotics, molecular modeling or geometry learning. Methods to resolve such constraints come from very different domains such as computer algebra systems, numerical analysis, graph theory, knowledge based systems and, obviously, geometry. This book shows how algorithm paradigms such as divide and conquer are used to decompose system of geometric constraints by using methods based on geometric properties.