The simplest approach is to check every single point. Compute the distance from the user's location to every restaurant in the database, keep the ones that are close enough, and throw away the rest.
Дания захотела отказать в убежище украинцам призывного возраста09:44
，详情可参考同城约会
Раскрыты подробности о договорных матчах в российском футболе18:01
At capacity 1, every point gets its own cell, and the tree subdivides as deeply as possible. At capacity 10, many points coexist in the same node, and the tree stays shallow.