Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates

Jean-Daniel Boissonnat, Jack Snoeyink. Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates. In Symposium on Computational Geometry. pages 370-379, 1999. [doi]

@inproceedings{BoissonnatS99,
  title = {Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates},
  author = {Jean-Daniel Boissonnat and Jack Snoeyink},
  year = {1999},
  doi = {10.1145/304893.304991},
  url = {http://doi.acm.org/10.1145/304893.304991},
  researchr = {https://researchr.org/publication/BoissonnatS99},
  cites = {0},
  citedby = {0},
  pages = {370-379},
  booktitle = {Symposium on Computational Geometry},
}