Thank you for the fast and clear answer, Wolfgang. Just add such a hash function for Point. It's true that two nearby points > will > have different hash values, but that shouldn't stop you from using hashes > if > you query the same points over and over.
This is definitely doable. > That said, I would suggest to do the indexing not on geometric locations > but > the logic position of a cell. You can either do that with a cell iterator > itself, or if you want to make it work in a parallel context, the CellId > of a > cell. I'm curious about this; if the material ID physically represents a location-based quantity (e.g., which vertical column of fluid as specified by a surface mesh), how come you recommend using the iteration order to specify it? Unless I'm misunderstanding what you mean by logic position of the cell w/r/t a cell iterator... Best, Corbin -- 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]. To view this discussion on the web visit https://groups.google.com/d/msgid/dealii/fdf1fd09-49c7-485a-9faa-9cc6f77c2143n%40googlegroups.com.
