Skip to Content.
Sympa Menu

cgal-discuss - Re: Re: RE: Re: Re: [cgal-discuss][Nef_polyhedron]A morecomplexbutstillsimplequestion

Subject: CGAL users discussion list

List archive

Re: Re: RE: Re: Re: [cgal-discuss][Nef_polyhedron]A morecomplexbutstillsimplequestion


Chronological Thread 
  • From: "Max" <>
  • To: "" <>
  • Subject: Re: Re: RE: Re: Re: [cgal-discuss][Nef_polyhedron]A morecomplexbutstillsimplequestion
  • Date: Thu, 7 Feb 2008 14:34:53 +0800
  • Disposition-notification-to: "Max" <>
  • Organization: LoadCom

>Hello Stephen,
>
>Thanks for your information.
>I'll test with this kernel and checkout the related archive.

I've digged into the archive and found the answer Peter Gave you:

Just use the undocumented function:

N = N.intersection(Plane_3(a,b,c,d));

If I understand correctly, it's senmatically equivalent to

N = N * Nef_3(Plane_3(a,b,c,d), Nef_3::INCLUDED);

except the fact that with it it's not mandatory to use an extended kernel.

>>Hi guys,
>>
>>Please find the conversation Peter and I have on the archives, the
>>half-spaces question has been answered previously there! Peter, you have
>>sent these to me!
>>
>>Max, I also use double coordinates with half-plane operations. I have used
>>Cartesian<Gmpq> (exact constructions, exact predicates).

One more question:
Do you use the indexed items type, i.e. SNC_indexed_items, or just the
default one?

Thanks
Max
>>
>>Stephen
>
>



Archive powered by MHonArc 2.6.16.

Top of Page