CGAL users discussion list

[SirM2X <>]

Given a polyhedron that was generated by a convex hull, my task is to use a
black box optimization algorithm to find a translation transform that when
applied to a specific set of points of the polyhedron, an objective function
is minimized.

Obviously, one approach is to regenerate the convex hull for every generated
translation. However, convex hull computation is slow, and also we know
a-priori that only a subset of the convex hull's points need to be modified
to minimize the objective function. So I thought, I'd generate the convex
hull once, use std::transform to modify a subset of the polyhedron's points,
and then compute the objective function. Something like this:



However, the above code results in different objective function values
compared to the case where I recompute the convex hull every /compute()/
call.

Is there an easy way to apply the translation trasnform to a subset of the
points of the polyhedron object?

Thanks in advance : )



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Transform-only-specific-vertices-of-a-Polyhedron-3-tp4662402.html
Sent from the cgal-discuss mailing list archive at Nabble.com.