| 795 | } |
| 796 | |
| 797 | U32 LASquadtree::intersect_rectangle(const F64 r_min_x, const F64 r_min_y, const F64 r_max_x, const F64 r_max_y, U32 level) |
| 798 | { |
| 799 | if (current_cells == 0) |
| 800 | { |
| 801 | current_cells = (void*) new my_cell_vector; |
| 802 | } |
| 803 | else |
| 804 | { |
| 805 | ((my_cell_vector*)current_cells)->clear(); |
| 806 | } |
| 807 | |
| 808 | if (r_max_x <= min_x || !(r_min_x <= max_x) || r_max_y <= min_y || !(r_min_y <= max_y)) |
| 809 | { |
| 810 | return 0; |
| 811 | } |
| 812 | |
| 813 | if (adaptive) |
| 814 | { |
| 815 | intersect_rectangle_with_cells_adaptive(r_min_x, r_min_y, r_max_x, r_max_y, min_x, max_x, min_y, max_y, 0, 0); |
| 816 | } |
| 817 | else |
| 818 | { |
| 819 | intersect_rectangle_with_cells(r_min_x, r_min_y, r_max_x, r_max_y, min_x, max_x, min_y, max_y, level, 0); |
| 820 | } |
| 821 | |
| 822 | return (U32)(((my_cell_vector*)current_cells)->size()); |
| 823 | } |
| 824 | |
| 825 | U32 LASquadtree::intersect_rectangle(const F64 r_min_x, const F64 r_min_y, const F64 r_max_x, const F64 r_max_y) |
| 826 | { |
nothing calls this directly
no outgoing calls
no test coverage detected