Learn More
This paper describes a flexible framework and an efficient algorithm for constraint-based spatio-temporal configuration problems. Binary constraints between spatio-temporal objects are first converted to constraint regions, which are then decomposed into hierarchical data structures; based on this constraint decomposition, an improved backtracking algorithm(More)
  • 1