glen/dyna3
1
0
Fork 0
Code Issues 9 Pull Requests 1 Actions Projects Releases 2 Wiki Activity

Update Engine prototype

Glen Whitney 2024-02-08 21:20:34 +00:00
parent cdac659153
commit cb668e4961
1 changed files with 12 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
Engine-prototype.md

@ -19,4 +19,15 @@ The size of the Gröbner basis depends a lot on the variable order. For the exam
* One point on a sphere * One point on a sphere
* Two points on a sphere * Two points on a sphere
* Three mutually tangent spheres * Three mutually tangent spheres
## General simplifications
Some of these are obvious, but we may as well write them down. Note we may want to simultaneously run different solvers/heuristics and update the display as they each return new/useful information, killing ones that become redundant.
* Keep the network of entities (or variables?) and constraints. Only ever work on one connected component of this at a time.
* Conversely, track rigid subnetworks, and replace them with fewer working variables. [What do we do about/how do we display over-constrained subnetworks? Do we display the configuration "nearest" to satisfying all the constraints in some sense but show it some bright alarm state the violated constraints, perhaps graded by "how badly" the constraint fails?]
* Track the current displayed witnesses of satisfying the constraints (after all, that's what we are showing). In lightly constrained networks, temporarily add constraints fixing all the entities except for the ones that are being moved, backing off on some temporary constraints by distance in the constraint network until we get a low-dimensional component that we are on, and move just along that component.
## Overall solver approaches
[Need to start listing some here.]