Hi Joel, Do you mean the index to a vertex? And by nearest, do you mean the vertex that shares the shortest common edge with the specified vertex? If so, then no. But it shouldn't be hard to write such a function. You would need to find all cells that share the initial vertex (I believe this is implemented <https://www.dealii.org/8.4.1/doxygen/deal.II/namespaceGridTools.html#addb822f0e3068e48640ecc981ee6c1e6>), then from that find all edges that share this vertex and simply compute the edge lengths and sort/filter accordingly. If you really need the DoFs associated with this index, then you can determine them at this point.
Regards, J-P On Thursday, September 1, 2016 at 4:05:39 PM UTC+2, Joel Davidsson wrote: > > Dear all, > > If I have the index to a dof, is there any easy way I can get indexes to > the nearest neighbor? > > Thanks, > > Joel > -- The deal.II project is located at http://www.dealii.org/ For mailing list/forum options, see https://groups.google.com/d/forum/dealii?hl=en --- You received this message because you are subscribed to the Google Groups "deal.II User Group" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
