%--------------------------------------------
% Line-segments intersection ...
%--------------------------------------------
@article
 {,
  author="B. Chazelle and H. Edelsbrunner",
  title="An Optimal Algorithm for Intersecting Line Segments
         in the Plane",
  journal="J. of the ACM",
  year="1992",
  volume="39",
  number="1-54",
  pages=""
}

@article
 {,
  author="H.G. Mairson and J. Stolfi",
  title="Reporting and counting intersections between
         two sets of line segments",
  journal="NATO Series - Theoritical Foundations of Computer
           Graphics and CAD",
  year="198",
  volume="F40",
  number="",
  pages=""
}

@inproceedings
 {,
  author="I. Balaban",
  title="An optimal algorithm for finding segments intersections",
  booktitle="$11^{th} ACM Symposium in CG$",
  address="Vancouver",
  year="1995",
  pages=""
}


@article
 {,
  author="K.Y Fung and others",
  title="Simplified linear-time Jordan sorting and polygon 
         clipping",
  journal="IPL",
  year="1990",
  volume="35",
  number="",
  pages=""
}


@inproceedings
 {,
  author="U. Finke and K. Hinrichs",
  title="Overlaying simply connected planar subdivisions in
         linear time",
  booktitle="$11^{th} ACM Symposium in CG$",
  address="Vancouver",
  year="1995",
  pages=""
}

@article
 {,


  journal="IPL",
  year="1990",
  volume="35",
  number="",
  pages=""
}