Hello, I'd like to know if there is a good way to do two things:
1. determine if an arbitrary point in real space is in the discrete problem domain, and 2. determine the distance to boundary of an arbitrary point along some line. Of course, these things can be done analytically for a given problem domain, but I'd like to know if these things can be achieved without hard-coding them for a specific problem domain. For example, I define my test problems using problem input files and the ParameterHandler class. I can think of one way to accomplish the above - I can supply for each test problem a distance function (for number 2) and a boolean is_in_domain() function (for number 1) in the problem input files. Is there perhaps a better way? Thank you, Joshua -- 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.
