Space-efficient geometric algorithms and data structures

By Ilya Katz and Hervé Brönnimann    

cgl
_point_position
bottom
BOTTOM
box_hull
box_type
COLLINEAR
contains
coord_type
disjoint
empty_halfplane
equals_lines_object
equals_xy_object
get_bottom
get_halfplane_points
get_left
get_right
get_top
get_x_coordinate
get_y_coordinate
halfplane_type
intersection
is_BOTTOM
is_empty_box
is_empty_halfplane
is_TOP
LEFT_TURN
less_nth_object
less_x_object
less_xy_object
less_y_object
line_type
lower_left
lower_right
make_box
make_box
make_empty_box
make_halfplane
make_halfplane
make_line
make_point
make_trianlge
multiD_point_type
point_in_box
point_in_closed_box
point_in_closed_triangle
point_in_halfplane
point_in_open_triangle
point_type
RIGHT_TURN
side
TOP
top
triangle_type
type
upper_left
upper_right

template<class NT, std::size_t N = 2>
bool cgl< NT, N >::point_in_box (  point_type  p,
box_type  box
)  [inline]
 

returns true of the point is contained with in the box

Definition at line 281 of file cgl.hpp.

Code Documentation generated Using Doxygen

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