Versions Compared


  • This line was added.
  • This line was removed.
  • Formatting was changed.

The design on this page should be considered obsolete - it doesn't actually solve the problems I was hoping it would solve.  Some of the discussion is still useful, as I think it provides at least some hints at a general path forward.  In the meantime, I think I have a much smaller modification to the current in algorithm in hand that should address the DM-19988 issue (while leaving more challenging problems - particularly the "jointcal problem" noted below) for the future.

The Main Problem

 is a symptom of a fairly deep problem in the current QuantumGraph generation algorithm: the algorithm at present assumes the set of data IDs to be processed is defined by a strict intersection of all relevant dimensions, according to their (usually spatial) relationships.  Because dimensions also provide a form of discretization that expands what's covered by that intersection, this does what we want as long as there is just one pairwise relationship in the query (i.e. visit_detector_region to patch), but it falls apart when that's not the case, such as: