Thread: AW: [Algorithms] Solving Box-Queries in 2D
Brought to you by:
vexxed72
From: <c.s...@ph...> - 2004-04-26 15:59:20
|
Multi resolution grids? -----Urspr=FCngliche Nachricht----- Von: gda...@li... = [mailto:gda...@li...] Im Auftrag von = Volker Poplawski Gesendet: Montag, 26. April 2004 12:55 An: gda...@li... Betreff: [Algorithms] Solving Box-Queries in 2D Hi all, i'm looking for a data structure/algorithm to handle box queries on a = large=20 set of points (or polygons) in 2d-space. I know there is quite some literature about this topic, but maybe = someone can=20 give me quick hint on where to look for. Need not to be optimal, just a = bit=20 better than my search-all-boundingboxes-approach. Regards ....Volker ------------------------------------------------------- This SF.net email is sponsored by: The Robotic Monkeys at ThinkGeek For = a limited time only, get FREE Ground shipping on all orders of $35 or = more. Hurry up and shop folks, this offer expires April 30th! = http://www.thinkgeek.com/freeshipping/?cpg=3D12297 _______________________________________________ GDAlgorithms-list mailing list GDA...@li... https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list Archives: http://sourceforge.net/mailarchive/forum.php?forum_id=3D6188 |