|
|
Strategy: line clipping algorithm after Liang Barsky. More...
Public Member Functions | |
| template<typename Linestring , typename OutputIterator > | |
| void | apply (Linestring &line_out, OutputIterator out) const |
| bool | clip_segment (Box const &b, segment_type &s, bool &sp1_clipped, bool &sp2_clipped) const |
Strategy: line clipping algorithm after Liang Barsky.
The Liang-Barsky line clipping algorithm clips a line with a clipping box. It is slightly adapted in the sense that it returns which points are clipped
| B | input box type of clipping box |
| P | input/output point-type of segments to be clipped |
| bool boost::geometry::strategy::intersection::liang_barsky< Box, Point >::clip_segment | ( | Box const & | b, |
| segment_type & | s, | ||
| bool & | sp1_clipped, | ||
| bool & | sp2_clipped | ||
| ) | const |
| void boost::geometry::strategy::intersection::liang_barsky< Box, Point >::apply | ( | Linestring & | line_out, |
| OutputIterator | out | ||
| ) | const |
|
April 2, 2011 |
Copyright © 2007-2011 Barend Gehrels, Amsterdam, the Netherlands Copyright © 2008-2011 Bruno Lalande, Paris, France Copyright © 2009-2010 Mateusz Loskot, London, UK |