|Topic was automatically imported from the old Question2Answer platform.
Title says main issue. I have a minimum spanning tree stored in an AStar Pathfinder object. I want to cycle through each node in the mst and automatically check against every other node in the tree if it can add an edge to that node without intersecting the mst in order to create loops like this
If the edge between two nodes would intersect with the mst, then it is ignored.
How can I implement this intersection detection?
Thank you and if you need any other details, please don’t hesitate to ask!
Had the exact same dilemma and solved it using this algorithm
Would share code and put an answer but can’t seem to find that project…apologies
Wakatta | 2023-01-13 01:31