Space-efficient geometric algorithms and data structures

By Ilya Katz and Hervé Brönnimann    

template<class Box, class RandomAccessIterator, class OutputIterator, class AxisAlignedGeometry>
OutputIterator inplaceds::closed_triangle_query_static_kdtree RandomAccessIterator  first,
RandomAccessIterator  last,
AxisAlignedGeometry  geom,
Box  Q,
OutputIterator  result
 

Returns iterator to a collection of points within closed triangle T.

Answers a query T, which must be convertible to Geom::triangle_type, and puts the points that fall within the query T in a range [result,result_end), where the distance between result and result_end is the number of points in the answer to the query. The return value is result_end. There must be sufficient storage after position result to hold the answer to the query. The range [first,last) must contain a valid static kd-tree as would be built by build_static_kd_tree(first,last,geom).

Definition at line 282 of file static_kd_tree.hpp.


Code Documentation generated Using Doxygen

Copyright © Ilya Katz and Hervé Brönnimann, 2005, 2006.