dualCellSurfaceAllIntersections is expensive, so do a faster prefilter to
label vertices as being near a boundary before calling that function.
May need more tuning on the distance from a surface that constitutes
being near a boundary.
- Add final version of range insert. This is faster than inserting points one
by one.
- Add a crude method to guess if an edge location that is near to another is
on a different edge and should be added. See the baffle case as an example
of where this is needed. Code is in nearFeatureEdge()
Now there is a search for the surface points to check whether they are close
to any other surface point. If they are, reject the point unless the angle
between the normals of the surfaces are around 180 degrees, which means that
the points are close but on opposite surfaces (i.e. there is a small gap).
There was a bug in feature point handling. normals that were effectively
parallel were not being picked up as being parallel, so a tolerance
has been added as a static const.
Surface conformation points are now not ust projected from oen point onto the
nearest surface, but projected onto any surface which the dual cell of the
Delaunay vertex cuts through.
CGAL algorithms such as incident_faces take a list and an output iterator as
arguments. They require the list to have push_back defined. Some std::lists
remain where this is the case.
- Remove cvMesh from constructor arguments for faceAreaWeightModel and cvControls
- Add I.H files for indexedCell and indexedVertex classes
- Separate feature point functions; put into conformalVoronoiMeshFeaturePoints.C
- Add feature point specialisations for 2 external and 1 internal edge
- Add a struct for feature point types
- Add a writeCellCentres function
