Generator of 2D Geometric Constraint Graphs

ABSTRACTIn 2-dimensional geometric constraint solving, graph-based techniques are a dominant approach, particularly in CAD context. These methods transform the geometric problem into a graph which is decomposed into small sub-graphs. Each one is solved, separately, and the final solution is obtained by recomposing the solved sub-graphs. To the best of our knowledge, there is no random geometric constraint graph generator so far. In this paper, we introduce a simple, but efficient generator that produces any possible geometric configuration. It would be parameterized to generate graphs with some desirable proprieties, like highly or weakly decomposable graphs, or restricting the generated graph to a specific class of geometric configuration. Generated graphs can be used as a benchmark to make consistent tests, or to observe algorithm behaviour on the geometric constraint graphs with different sizes and structural properties. We prove that our generator is complete and suitable for two main classes of solvi...