A Hybrid Method for Solving Geometric Constraint Problems

  • Authors:
  • Xiao-Shan Gao;Lei-Dong Huang;Kun Jiang

  • Affiliations:
  • -;-;-

  • Venue:
  • ADG '00 Revised Papers from the Third International Workshop on Automated Deduction in Geometry
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose an algorithm for solving geometric constraint problems. The algorithm has linear complexity for constrained systems without loops, and is of quadratic complexity for constraint problems with loops. This algorithm is complete for constraint problems about simple polygons. The key of the algorithm is to combine the idea of graph based methods for geometric constraint solving and geometric transformations from rule-based methods.