CGAL users discussion list

[郑银河 <>]

Thanks for your kind replies.
Finally, I am planning to implement this feature by my self to solve my 
problem.

2015-10-28 1:49 GMT-07:00 Phil Weir 
<>:
> Hello,
>
> On 10/28/2015 03:26 AM, 郑银河 wrote:
>>
>> ...
>> I am trying to do 3D constrained Delaunay triangulation using CGAL.
>> The domain is described using Piecewise Linear Complexes (PLS) in 3D,
>> i.e., each bounday polygon of the domain is known but the bounday mesh
>> of the domain is not generated . The domain may contain 0d, 1d
>> features.
>>
>> I tried to use the 3D Mesh Generation package to do the job. However,
>> in order to use this package, I should first convert the PLS to a
>> boundary mesh, which is difficult because the PLS may contain
>> unmanifold edges.
>>
>> I am wondering if there is some method in CGAL that can be used to
>> generate the constrained Delaunay triangulation from a set of bounded
>> polygons?
>
> On the off-chance a less strict volumetric mesh, with a tolerance, rather
> than a constrained Delaunay triangulation, is sufficient, and you can
> formulate an in-out identity function, that might get you somewhere. Not so
> helpful if you need exact matching, of course, or for preserving your
> features, but just to mention it. (Apologies for posting the same suggestion
> on another related topic, but I recall struggling to generate CDTs some time
> before realising the use-case didn't actually require it)
>
> All the best,
> PTW
>
> --
> __________________________
> Phil Weir | NUMA Engineering Services Ltd.
> Block 1, Quayside Business Park,
> Mill St, Dundalk,
> Co. Louth, Ireland.
> Tel: +353 42 9395821 | Fax: +353 42 9390220
> _______________________
>
>
>
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://sympa.inria.fr/sympa/info/cgal-discuss
>
>