How to count the intersections of n segments in n log n

Правка en1, от Usu, 2019-03-15 23:23:42

Hey! Does anybody know how to solve this? Given n segments, count how many pairs of segments have a common point. There are no 2 overlapping segments and the segments are can make any angle with the origin of the cartesian plane.

Теги #geometry

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Usu 2019-03-15 23:23:42 284 Initial revision (published)