• DocumentCode
    1293521
  • Title

    Comments on “algorithms for reporting and counting geometric intersections”

  • Author

    Brown, K.Q.

  • Author_Institution
    Carnegie-Mellon Univ., Pittsburgh, PA, USA
  • Issue
    2
  • fYear
    1981
  • Firstpage
    147
  • Lastpage
    148
  • Abstract
    Comments on the paper by Bentley and Ottman (ibid., vol.28, p.643-7, 1979) which presents an algorithm for reporting all K intersections among N planar line segments in 0((N+K) log N) time and 0(N+K) storage. With a small modification that storage requirement can be reduced to 0(N) with no increase in computational time, which is important because K can grow as 0(N2).
  • Keywords
    computation theory; computational geometry; computational time; computer metatheory; geometric intersections; planar line segments; Algorithm design and analysis; Computers; Decoding; Encoding; Minimization; Optimization; Read only memory; Computational geometry; VLSI design rule checking; geometric intersection problems; optimal algorithms;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1981.6312179
  • Filename
    6312179
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1293521