Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] plane/concave polyhedron intersection

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] plane/concave polyhedron intersection


Chronological Thread 
  • From: "Giampaolo Bellini" <>
  • To:
  • Subject: Re: [cgal-discuss] plane/concave polyhedron intersection
  • Date: Fri, 11 Apr 2008 15:18:40 +0200
  • Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:to:subject:in-reply-to:mime-version:content-type:content-transfer-encoding:content-disposition:references; b=Ic1Lr1wAg8a/hIUgiYVoCmNtZa6/mwI8PE76jB9bNGMDIJpDb50+DJLPVMNhVeGE8LqPx10Y1jrdc7pWuK+ooFG5yvqQ7mxp/jLr7qDbbb/agWI+/JINcijaIf0xRpyWP6EwhuMQ1pQ2M5ijYQkO5PtNt65eMFd89CG4OccXDIk=

Hi Peter

thanks for for your quck reply.

> with 3D Nef polyhedra it is not a problem to do intersection of planes
> and polyhedra. The problem in your case is the file format. We don't
> support stl files at the moment.

this is not a problem as writing a parser for stl is really a simple
task... I have a simple library based on FLEX... could it helps ?

> I can write a constructor for stl files
> for you in an hour, but it will not be very efficient. It will construct
> every facet as a separate Nef polyhedron

really ? sound great!
I'm just looking at NEF polyhedron as they are totally new for me.

> So now the question is, how
> big your input data is, and how important the construction efficiency is
> for you.

actually efficenty is not a problem as I'm still experimenting with
STL... and I don't know exactly where I'm gone :-)

> Peter

again, thanks a lot for your help, Peter...

Andy



Archive powered by MHonArc 2.6.16.

Top of Page