Reactangles in 2d space

Revision en1, by 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)?

Tags computational geometry, #data structure

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English callias 2018-07-12 10:48:09 246 Initial revision (published)