Here is the cube with a hole:

https://drive.google.com/open?id=1Z4D4YWAkIMxDk54Pa2umDKKNXeOWQFkC<

https://drive.google.com/open?id=1Z4D4YWAkIMxDk54Pa2umDKKNXeOWQFkC>

The code example takes time to make. I will try. What I'm doing is the

following:

Input: a mesh represented in our own data structure

For each hole of the mesh:

- get the hole of the mesh -> H, neighboring faces of H -> S (to be used as

constraint)

- patch the hole: triangulate_hole_polyline(), denote the patch faces P

- lift P along normals of the boundary of H, and connect the boundary of P

and boundary of H with a strip of triangle faces Q. This is to guarantee

only P can change during refinement, while boundary of H stays untouched

- refine P using refine()

- perform fairing on Union{P, Q}, with S as constraint

Note: before fair(), none of P, Q, or S contains thin triangles.

Since our mesh is pretty big, and may contain other artifacts, we can't

convert it to CGAL's mesh structure. Instead we chose to convert small

region around the hole to CGAL's Surface_mesh as each hole is processed.

Meanwhile, may I ask which section is implemented by fair() in the paper "On

Linear Variational Surface Deformation Methods"? Since it's a survey, does

it reference an older paper that describes exactly what fair() does?

--

Sent from:

http://cgal-discuss.949826.n4.nabble.com/--

You are currently subscribed to cgal-discuss.

To unsubscribe or access the archives, go to

https://sympa.inria.fr/sympa/info/cgal-discuss