Computational Science Stack Exchange is a question and answer site for scientists using computers to solve scientific problems. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Some background: the Front-Tracking method uses a triangular surface mesh to describe the boundary between two immiscible fluids. To deal with the breakup and coalescence of the fluid interface, direct topological operations are executed on the surface mesh. Since in this case, there exists a history of topological operations between the old and the new mesh, it is possible to conservatively map a field stored on the surface mesh before and after topological operations. This is used e.g. to solve transport equations for a surfactant (a field that describes surface-active agents whose concentration on the fluid interface changes the surface tension).

What I would like to know if there is an established algorithm that can logically connect two completely topologically disconnected surface meshes that could serve as a mapping basis?

E.g. something like the nearest element search algorithm: for each triangle of surface mesh A, find the nearest triangle of surface mesh B.

share|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.