From: John Femiani (JOHN.FEMIANI_at_[hidden])
Date: 2008-03-26 00:32:45
> - Another 2 types of geometries I found useful in certain algorithms
> (e.g. computing straight skeletons or line widening) are infinite
> and rays, along with segments that you already have. The key
> for them are of course intersections.
> - Point to linestring distance algorithm should be able to provide the
> information (iterator?) as to which segment (or vertex) of the line
> turned out to be the closest.
> - Something I was thinking about but has never done yet... which of
> geometrical algorithms could be effectively implemented on sequences
> polynomial curve segments (quadratic and cubic Beziers are my natural
> favorites)? If feasible, this would be a very powerful tool for 2D
> More to come.
I am extremely interested in a boost affine geometry library, but given
the history on this mailing list I suspect the best approach might be to
start with less rather than more. I don't know if this works with boost
libraries but I think I would like it if a minimal
point/vector/coordinates library, which basically just provided concepts
and models for proof of concept, was accepted and additional algorithms
on top of them came later.
-- John C. Femiani
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk