Hierarchical satisfaction #39

New issue

Open

opened 2025-01-30 16:48:25 +00:00 by glen · 0 comments

glen commented

2025-01-30 16:48:25 +00:00

Owner

For example, with such a system, it would be possible to try to nudge by taking the current configuration, and adding priority -2 constraints that all of the coordinates of the entity being nudged are preserved except for the one being nudged (and of course a redundant one like the coradius has to be able to move in concert), and then a priority -1 constraint that the coordinate being nudged is equal to its current value plus epsilon. This would be nudging without explicit use of the tangent space.

There are numerous other scenarios for such a facility: previewing, dragTo (rather than nudge), I am sure there are more.

I think a system by which constraints can be prioritized so that if there is a configuration satisfying them all it is found; if not, the lowest-priority constraints are dropped and a configuration satisfying them is sought; and so on until only the "hard" constraints are left (call them priority 0), at which point the system attempts to find the configuration that comes "nearest" to satisfying them. For example, with such a system, it would be possible to try to nudge by taking the current configuration, and adding priority -2 constraints that all of the coordinates of the entity being nudged are preserved except for the one being nudged (and of course a redundant one like the coradius has to be able to move in concert), and then a priority -1 constraint that the coordinate being nudged is equal to its current value plus epsilon. This would be nudging without explicit use of the tangent space. There are numerous other scenarios for such a facility: previewing, dragTo (rather than nudge), I am sure there are more.