|
From: James W. <ja...@fr...> - 2007-02-21 23:10:06
|
Roger Holmes wrote: > On 21 Feb, 2007, at 19:18, James Walker wrote: >> Here's a proposal: >> >> 1. Store the hits, or pointers to them, in a std::vector. This will >> allow e3pick_hit_find to work in constant time with no caching. > > That would be great. > >> 2. Don't keep the hits sorted as they're being collected. Instead, >> sort >> them all at once the first time Q3Pick_GetPickDetailData or >> Q3Pick_GetPickDetailValidMask is called after the picking is done. >> The >> sorting can be used with std::sort, in time on the order of H log H. > > Yes, though of course there's no need to do the sort at all for > kQ3PickSortNone. Right. I've committed this change to E3Pick.c. -- James W. Walker, Innoventive Software LLC <http://www.frameforge3d.com/> |