# An Edge-Crossing program - is it useful?

**URL:** <https://forum.graphviz.org/t/an-edge-crossing-program-is-it-useful/3029>\
**Category:** Help\
**Created:** [June 16, 2025, 3:19pm UTC](https://forum.graphviz.org/t/an-edge-crossing-program-is-it-useful/3029 "2025-06-16T15:19:53Z")\
**Posts on this page:** 1\
**Showing post:** 4

<div class="post-metadata">

**Author:** ![steveroush](https://avatars.discourse-cdn.com/v4/letter/s/a9adbd/32.png) [@steveroush](https://forum.graphviz.org/u/steveroush)\
**Post date:** [June 16, 2025, 9:05pm UTC](https://forum.graphviz.org/t/an-edge-crossing-program-is-it-useful/3029/4 "2025-06-16T21:05:46Z")

</div>

The scheme described above can _probably_ be extended to identify the intersection edges (based on edge colors), but TBD.  
Likewise, cleaning-up (simplifying) long intersections of nearly parallel edges is very TBD.

Stephen’s suggestion of non-connecting edges might be better implemented using algebra - at least if all the edges consisted of straight-line segments. But this seems to be effectively an N-squared problem - compare every edge segment to every other edge segment. Clever programming can probably save many cycles, but I’m out of clever.  
Finding intersections of non-straight splines would appear to be even more challenging.

---

_[View the full topic](https://forum.graphviz.org/t/an-edge-crossing-program-is-it-useful/3029)._