CGAL users discussion list

[Phil Weir <>]

On 26/08/13 12:26, ChaoM wrote:
> Hello Sartaj Hundal :
>      Thanks for quick reply.
>      A forward question: I want to know how the CGAL sovle the 3d boolean
> opreation besides Nef, since i find Nef costs too many time , and I can not
> understand how to use it.
<snip>
If you did not want to use Nef, you can define a level set function and 
then use ImplicitDomainFunction (examples in docs) - assuming you can 
define inside or outside using the polarity (+/-), it is possible to 
combine this with an AABB tree distance search to get a continuous 
function sloping to the boundary (while I don't think that's necessary I 
assume the boundary search algorithm performs most efficiently for 
better behaved functions...?).
Phil