Re: Points in rectangles
- From: Alan S <AlanS222@xxxxxxxxx>
- Date: Wed, 26 Oct 2005 14:46:35 GMT
"Grigory Begelman" <gbegel@xxxxxxxxx> wrote:
>Is the problem known? Is there an efficient solution to it (better than
>O(N))?
Yes. A uniform grid, BSP, quadtree ..etc will all give you sublinear
performance (almost constant for uniform, ln for trees) at the expense
of varying memory usage. You can google/wiki these terms.
.
- Follow-Ups:
- Re: Points in rectangles
- From: Grigory Begelman
- Re: Points in rectangles
- Prev by Date: Re: nurbs surface
- Next by Date: Re: Source code or algorithm for these effects??
- Previous by thread: How To Transform Color?
- Next by thread: Re: Points in rectangles
- Index(es):
