return a list of all the wire Nets in the model Each element has form (source port Id, list of wires driven by port)

Filter visSegs so that if they overlap with common start only the longest is kept. ASSUMPTION: in a connected Net this will remove all overlaps

Filter visSegs so that if they overlap with common start only the longest is kept. More accurate version of distinctVisSegs. Use if the accuracy is needed.

return a lits of all the distinct visible segments visible segments in a Net are defined as a pair (start,end) of vertices. Filter visible segments so they do not overlap where segments overlap only the longest is taken ASSUMPTION: all overlaps are on segments with same starting point

input is a list of all the wires in a net. output a list of the visual segments. isDistinct = true => remove overlapping shorter segments

Returns true if two segments (seg1, seg2) cross in the middle (e.g. not a T junction). Segment crossings very close to being a T junction will be counted. That however should not happen? Seg1, seg2 are represented as pair of start and end vertices

print a visual segment in an easy-toread form

Input must be a pair of visula segment vertices (start, end). Returns segment orientation

The visible segments of a wire, as a list of vectors, from source end to target end. Note that in a wire with n segments a zero length (invisible) segment at any index [1..n-2] is allowed which if present causes the two segments on either side of it to coalesce into a single visible segment. A wire can have any number of visible segments - even 1.

visible segments in a Net defined as a pair (start,end) of vertices. source: the source port driving the Net start is the segment end nearest the wire Source. isDistinct = true => filter visible segments so they do not overlap where segments overlap only the longest is taken ASSUMPTION: all overlaps are on segments with same starting point

visible segments in a wire as a pair (start,end) of vertices. start is the segment end nearest the wire Source.