CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

If you're looking for 3D snap-rounding, this is a very complicated
problem. I don't think there is an easy want to do this.
A solution might be to convert the nef to a polyhedron, move the
point, compute self-intersections, cross finger and hope
there will be no or only easy one to fix.

Sebastien.

http://doc.cgal.org/4.7/Polygon_mesh_processing/group__PkgPolygonMeshProcessing.html#ga8a27d056519cc5d2b1a7726bdc5ef0f6
http://doc.cgal.org/4.7/Polygon_mesh_processing/group__PkgPolygonMeshProcessing.html#ga0beba25d03a16010b20e2c9b6771cd12

On 10/08/2015 10:32 PM, Robert W. Johnstone wrote:
> Hello Everyone,
>
> I understand that there will likely be an impact on robustness, but I
> would like to know if there is a way to snap the coordinates of a Nef_3
> to integer coordinates.
>
> The program will create the union of many polyhedra, which I'm planning
> to do with an exact kernel to avoid issues, and then post-process the
> resulting polyhedron to snap the vertices.  Are there any suggestions to
> how this could be done efficiently?
>
>
> Thank-you,
>
> Robert
>
>
> --
> ----------------------------------------
> Robert W. Johnstone
> In theory, there is no difference between theory and practice.
> In practice, there is.