From Navit's Wiki
Revision as of 09:33, 21 March 2013 by Alx (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

The model in which problems are cut into pieces to reach a solution is called quadtrees. They have been used in image compression too. A good reference can be found here:

How is implemented address search on binfile maps? --Alx (talk) 10:33, 21 March 2013 (CET)