CGAL - mess (committee design and C ++, always dangerous), IMHO. Itโs hard to penetrate.
But do you need to calculate the Voronoi diagram on the device? If your data set is street data, it may not change so much, and you can pre-create it outside the device.
Finally, the Voronoi diagram is a powerful construction, but here it may be redundant. If you want to avoid a large library, a simple heuristic is enough: place dots along your street segments. Given the user's location, find the nearest street (using, say, a kd tree - it's easy to implement, quickly, many implementations are available). Use the ones to check the selection of candidates for segments to find the closest.
payne source share