* inserts them into the graph.
* @param edge
* @param l
*/
public void computeEdgeEnds(Edge edge, List l) {
EdgeIntersectionList eiList = edge.getEdgeIntersectionList();
// Debug.print(eiList);
// ensure that the list has entries for the first and last point of the
// edge
eiList.addEndpoints();
Iterator it = eiList.iterator();
EdgeIntersection eiPrev = null;
EdgeIntersection eiCurr = null;
// no intersections, so there is nothing to do
if (!it.hasNext())
return;