dolfin team mailing list archive

[dolfin@xxxxxxxxxx (DOLFIN)]

One or more new changesets pushed to the primary dolfin repository.
A short summary of the last three changesets is included below.

changeset:   3818:3e261540c75df89e6a40b5f2ae370c20edb493db
tag:         tip
parent:      3816:366d13267a898e1c540031b068f7ad5e88cca22a
parent:      3817:15f34883e0f9de65a5840dbfc2073fd1ad06b9b0
user:        "Anders Logg <logg@xxxxxxxxx>"
date:        Sat Mar 29 21:01:47 2008 +0100
files:       dolfin/mesh/TetrahedronCell.cpp
description:
Merge work on intersection of line segment with mesh from Dag Lindbo


changeset:   3817:15f34883e0f9de65a5840dbfc2073fd1ad06b9b0
parent:      3744:fbadc9e00e20400dcd8de6445f8b2f1e627095d9
user:        dag@xxxxxxxxxxxxxxxx
date:        Thu Mar 20 08:40:39 2008 +0100
files:       dolfin/mesh/CellType.h dolfin/mesh/GTSInterface.cpp dolfin/mesh/IntervalCell.cpp dolfin/mesh/IntervalCell.h dolfin/mesh/PointCell.cpp dolfin/mesh/PointCell.h dolfin/mesh/TetrahedronCell.cpp dolfin/mesh/TetrahedronCell.h dolfin/mesh/TriangleCell.cpp dolfin/mesh/TriangleCell.h
description:
Added intersection between a line segment and a triangle. This makes it possible to compute which triangles a curve cuts through. The forst step is a bounding box tree search, where the bounding box of the line segment is intersected with the bounding boxes of all triangles. This is fast. For each triangle found in the bounding box search, the line segment is explicitly intersected with that triangle to see if there really is an intersection. This step uses Shewchuk predicates.


changeset:   3816:366d13267a898e1c540031b068f7ad5e88cca22a
user:        "Anders Logg <logg@xxxxxxxxx>"
date:        Sat Mar 29 20:39:24 2008 +0100
files:       misc/utils/convert/dolfin-convert
description:
Exodus patch from Gideon Simpson

----------------------------------------------------------------------
For more details, visit http://www.fenics.org/hg/dolfin