0hmx - Any idea on how we can untangle this! Li...
Any idea on how we can untangle this! Like, I am not getting any idea! What could be the condition
15 Replies
None that are easy to explain haha. Try thinking about how to “flip” two lines and measure the number of intersections
You can then do “operation-path A*” to optimize for the best operations for the lowest cost
If Gemini explained to me correctly, my last try was pretty close to your comment! Like flipping to form an inverted L, I guess my logic to find the points for flipping is bad, or I need to debug more
Err sorry , dont flip. The operation should take two lines or segments as input and swap how they overlap
just a thought, we can count the number of times two traces intersects if it is an ever number we can untangle it by moving one trace in opposite direction from the other
same issue here https://github.com/tscircuit/schematic-trace-solver/issues/83
we can add another step it solver to implement this, i think
Yes something like that
It has to be tested etc
i struggled with this for a day, then gave up
💀
Yea it isnt easy
Big contribution though
while i was trying that i found that some labels were overlapping
yea it's not easy
@Seve GraphicsObject rendering, specifically for lines and points: Does the rendering logic implicitly round or snap x and y coordinate values to a pixel grid or any other discrete unit? I am observing mathematical line intersections that don't visually appear to collide, and I think rendering precision could be a factor.
:warning: Please avoid using excessive mentions, as it creates unnecessary notifications and disrupts others — use mentions only when truly needed to keep the discussion focused and respectful; repeated misuse may lead to moderation action.
Editing the message multiple times could also trigger the bot. igs
It shouldnt
Ive never seen snapping
Hell ya! we did it! going to take some time to optimze the algo and add extra test case but we golden
its wokring!!!!