intersection of triangulated surfaces
aftosmis at nas.nasa.gov
Thu Feb 7 11:15:32 PST 2002
NASA's "Intersect" code will intersect any number of triangulated
provided that each of the surfaces is both closed and manifold
(the code intersects simplicial polytopes and trims away interior
(and skim down 1 paragraph to "intersect").
The code uses robust arithmatic and automatic tie-breaking for
A good first reference for this code is AIAA Paper 97-0196: "Robust
and Efficient Cartesian Mesh Generation for Component-Based Geometry"
which is downloadable from
Andreas Fabri wrote:
> Can anybody give me a pointer to software that is capable of computing the intersection
> of two triangulated surfaces embedded in 3-space (or of a polygon soup)
> There is a lot around at UNC integrated in collision detection software, but it
> seems that there the software is optimized for collision checking queries of small
> objects against large scenes. That is they have high preprocessing costs to
> generate search structures for the scenes.
> I also saw the AABbox in GTS (GNU Triangulated Surface), but there the problem
> is probably the same as for the collision checkers.
> 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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.
The compgeom mailing lists: see
or send mail to compgeom-request at research.bell-labs.com with the line:
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.
More information about the Compgeom-announce