Subject: [ggl] Proposal for Delauney triangulation algorithm
From: Bruno Lalande (bruno.lalande)
Date: 2011-10-20 04:08:02
Ii could be interesting.
First, have you checked that the license used by this library is compatible
with what you want to do?
Second, not sure you get well what implementing a Boost.Geometry algorithm
really is about. You're talking about replacing the classes in the library
(point, polygon) by the ones provided by Boost.Geometry. But that's not the
point: the purpose of Boost.Geometry algorithms is to be able to work on any
data type, as long as it meets some requirements. So basically your
algorithm will not know/use geometries from Boost.Geometry directly, but its
concepts. You'll have to use all the metafunctions and other mechanisms that
allow us to manipulate our data through concepts and not directly. Was this
-------------- next part --------------
An HTML attachment was scrubbed...
Geometry list run by mateusz at loskot.net