311545
For an input consisting of n line segments with k crossings , the Bentley – Ottmann algorithm takes time O ( ( n + k ) log n ) .
 None
Please list all entity words in the text that fit the category. Output format is "word1, word2". 
Option: location, person, organization 
Text: {0} 
Answer:
 None