Subject: CGAL users discussion list
List archive
- From: "Jens K. Becker" <>
- To:
- Subject: Triangulation of several polyhedra
- Date: Tue, 11 Sep 2007 19:07:01 +0200
Hi List,
I am writing a numerical simulation software to simulate geological processes on
the grain scale. A grain is represented by a single polyhedron and several
polyhedra define the structure that is to be modeled. This all works fine, the
problems comes when I have to delete or add facets to a polyhedron (because
they get too small or too large). The problem is easier to understand (I hope)
if you visualize two cubes sharing a common boundary (a plane). This plane
consists of several facets (all triangles, this is a precondition in my
program). How can I make sure that the triangles match (meaning that each
triangle of both planes of both cubes is made up of the same three vertices)?
Yes, for a cube that is simple but I have no idea how to do that if, for
example, I have to spheres (or any arbitrary shape) that intersects.
Calculating the intersection of both spheres is no problem using boolean
operations using Nef-polyhedra, but the resulting boundary between the two
spheres are not made up of the same triangles.
I hope this is enough so that you understand my problem. I would be very happy
to hear your suggestions on how to solve this problem, if you have any.
Thanks for your help,
Jens
--
Dr. J.K. Becker
University of Tuebingen - Institute for Geoscience
Sigwartst. 10 - 72076 Tuebingen (Germany)
Tel.: ++49 7071 29 73139 Fax: +49 7071 5059
web: http://www.jkbecker.de
- compiler warning under vs7.1 for 3.3.1 (minor), Peter Schröder, 09/11/2007
- Triangulation of several polyhedra, Jens K. Becker, 09/11/2007
- Re: [cgal-discuss] compiler warning under vs7.1 for 3.3.1 (minor), Sylvain Pion, 09/11/2007
Archive powered by MHonArc 2.6.16.