Intersections of triangulated surfaces?
aftosmis at nas.nasa.gov
Mon Oct 25 16:00:48 PDT 1999
take a look at
See if its close to what you want. If the inputs are
simplicial polyhedra, I think that "intersect" will do
what you want. You can get this package from NASA Ames.
The algorithm is written up in:
(click "AIAA 97-0196")
or in more detail at:
Take a look at
to see about getting a copy of the software.
Steve Zoraster wrote:
> I am looking for papers or algorithms which provide
> efficient solutions to the problem of cutting one
> triangulated surface model by another triangulated
> surface model. The desired output would be the two
> separated sections of the original surface,
> re-triangulated along the cut line....
> Thanks. Responses I get through direct e-mail will
> be posted back to this list.
> Steven Zoraster
> szz at zycor.lgc.com
> The compgeom mailing lists: see
> or send mail to compgeom-request at research.bell-labs.com with the line:
> send readme
> Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html.
The compgeom mailing lists: see
or send mail to compgeom-request at research.bell-labs.com with the line:
Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html.
More information about the Compgeom-announce