Question: Decomposing path to cell paths? #925

Activity

1. akabbeke commented on Oct 10, 2024

   

   akabbeke

   on Oct 10, 2024

   Author

   More actions

   The solution I was considering was to try a kind of binary search. Find where the line intersects the cell boundary for the first and last cells. If the intersections are at the same location then we know they are neighbours and the line passed through a shared boundary edge. If not then find the midpoint between the two points and repeat the process until an unbroken line exists between the original start and end points.

   I’m fairly certain the above approach works, but I’m not sure if it is the most efficient approach or if there exists a better method.
2. dfellis commented on Oct 10, 2024

   

   dfellis

   on Oct 10, 2024

   Collaborator

   More actions

   This should be a discussion, not an issue with the library. I am going to try to convert it, but this is my first time doing so.
3. uber

   locked and limited conversation to collaborators on Oct 10, 2024
4. dfellis

   converted this issue into a discussion #928 on Oct 10, 2024