DirectedEdgeStar

Compute the labelling for all dirEdges in this star, as well as the overall labelling

Traverse the star of edges, maintaining the current location in the result area at this node (if any). If any L edges are found in the interior of the result, mark them as covered.

Insert a directed edge in the list

Traverse the star of DirectedEdges, linking the included edges together. To link two dirEdges, the <code>next</code> pointer for an incoming dirEdge is set to the next outgoing edge.

DirEdges are only linked if:

• they belong to an area (i.e. they have sides)

• they are marked as being in the result

Edges are linked in CCW order (the order they are stored). This means that rings have their face on the Right (in other words, the topological location of the face is given by the RHS label of the DirectedEdge)

PRECONDITION: No pair of dirEdges are both marked as being in the result

For each dirEdge in the star, merge the label from the sym dirEdge into the label

Update incomplete dirEdge labels from the labelling for the node

return the coordinate for the node this star is based at

Insert an EdgeEnd into the map, and clear the edgeList cache, since the list of edges has now changed

Iterator access to the ordered list of edges is optimized by copying the map collection to a list. (This assumes that once an iterator is requested, it is likely that insertion into the map is complete).

A list of all outgoing edges in the result, in CCW order

A map which maintains the edges in sorted order around the node