A Principled Approach Towards Symbolic Geometric Constraint Satisfaction
<|reference_start|>A Principled Approach Towards Symbolic Geometric Constraint Satisfaction: An important problem in geometric reasoning is to find the configuration of a collection of geometric bodies so as to satisfy a set of given constraints. Recently, it has been suggested that this problem can be solved efficiently by symbolically reasoning about geometry. This approach, called degrees of freedom analysis, employs a set of specialized routines called plan fragments that specify how to change the configuration of a set of bodies to satisfy a new constraint while preserving existing constraints. A potential drawback, which limits the scalability of this approach, is concerned with the difficulty of writing plan fragments. In this paper we address this limitation by showing how these plan fragments can be automatically synthesized using first principles about geometric bodies, actions, and topology.<|reference_end|>
@article{bhansali1996a,
    title={A Principled Approach Towards Symbolic Geometric Constraint Satisfaction},
    author={S. Bhansali, G. A. Kramer, T. J. Hoar},
    journal={Journal of Artificial Intelligence Research, Vol 4, (1996),
  419-443},
    year={1996},
    archivePrefix={arXiv},
    eprint={cs/9606101},
    primaryClass={cs.AI}
}