Boost logo

Boost :

From: Fernando Cacciola (fernando.cacciola_at_[hidden])
Date: 2008-01-15 14:06:13

Hi Barend,

> Hi,
> Is there any interest in a template geometry library?
Depends on the details ;)

> Data and algorithms are separated, so there are algorithms like:
> template <typename P, typename POL>
> bool point_in_polygon(const P& p, const POL& pol);
What algorithm is implemented for this function?

How does it handle robustness issues?

What are the geometric requirements on the input polygon? (i.e. must be
simple? strictly simple?)
What if the point is exactly *over the boundary* of the polygon?

> and like this:
> template <typename S1, typename S2, typename MP>
> intersection_result intersection_segment(const S1& segment1, const S2&
> segment2, MP& multipoint);
What is a multipoint?

What if the segments are collinear (hence their intersection is another

How does it handle robustness issues?


Fernando Cacciola

Boost list run by bdawes at, gregod at, cpdaniel at, john at