Reactangles in 2d space

Правка en1, от callias, 2018-07-12 10:48:09

There are many 2D rectangles in 2D space. Given a point, suppose this point did not hit (inside of) any rectangle, find the one rectangle it is closest to. Assume the rectangles are not rotated. Can it be faster than O(n)?

Теги computational geometry, #data structure

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский callias 2018-07-12 10:48:09 246 Initial revision (published)