diff --git a/applications/utilities/mesh/generation/cvMesh/conformalVoronoiMesh/conformationSurfaces/conformationSurfaces.H b/applications/utilities/mesh/generation/cvMesh/conformalVoronoiMesh/conformationSurfaces/conformationSurfaces.H index d8e5fd0166..ce56a977aa 100644 --- a/applications/utilities/mesh/generation/cvMesh/conformalVoronoiMesh/conformationSurfaces/conformationSurfaces.H +++ b/applications/utilities/mesh/generation/cvMesh/conformalVoronoiMesh/conformationSurfaces/conformationSurfaces.H @@ -285,7 +285,9 @@ public: ) const; //- Find the nearest points on each feature edge that is within - // a given distance from the sample point + // a given distance from the sample point. Will need to check for + // a hit or a miss because near edges may not have a nearest point + // on them which is perpendicular to the sample point. void findAllNearestEdges ( const point& sample, diff --git a/src/edgeMesh/extendedFeatureEdgeMesh/extendedFeatureEdgeMesh.C b/src/edgeMesh/extendedFeatureEdgeMesh/extendedFeatureEdgeMesh.C index 0ebb7b58ab..81f853aa41 100644 --- a/src/edgeMesh/extendedFeatureEdgeMesh/extendedFeatureEdgeMesh.C +++ b/src/edgeMesh/extendedFeatureEdgeMesh/extendedFeatureEdgeMesh.C @@ -546,6 +546,49 @@ Foam::extendedFeatureEdgeMesh::extendedFeatureEdgeMesh } featurePointNormals_ = featurePointNormals; + + + // Create featurePointEdges_ + // For each feature point, stores a list of edges which are arranged in + // order according to their connectivity + +// featurePointEdges_.setSize(nonFeatureStart_); +// +// Info<< sFeatEds.size() << " " << surf.pointEdges().size() << " " +// << edges().size() << endl; +// +// forAll(sFeatEds, eI) +// { +// Info<< "Edge " << eI << " " << sFeatEds[eI] << " " +// << edges()[eI] << endl; +// } +// +// const edgeList& edges = eds; +// +// for (label i = 0; i < nonFeatureStart_; i++) +// { +// const labelList& ptEds = surf.pointEdges()[i]; +// +// DynamicList