public EdgeIntersection add(Coordinate intPt,int segmentIndex,double dist){
  EdgeIntersection eiNew=new EdgeIntersection(intPt,segmentIndex,dist);
  EdgeIntersection ei=(EdgeIntersection)nodeMap.get(eiNew);
  if (ei != null) {
    return ei;
  }
  nodeMap.put(eiNew,eiNew);
  return eiNew;
}

public EdgeIntersection add ( Coordinate intPt , int segmentIndex , double dist ) { EdgeIntersection eiNew = new EdgeIntersection ( intPt , segmentIndex , dist ) ; EdgeIntersection ei = ( EdgeIntersection ) nodeMap . get ( eiNew ) ; if ( ei != null ) { return ei ; } nodeMap . put ( eiNew , eiNew ) ; return eiNew ; }
adds an intersection into the list , if it isn ' t already there . the input segmentindex and dist are expected to be normalized .
