Meshing Algorithms (URL)
Author: Andrei V Smirnov
Application: SURFER - Surface Meshing With MC/PF Algorithms
Produces a triangulated surface mesh from level-set function defined on a rectangular grid.
The algorithm consists of two parts:
- A node-placement procedure to produce a regular set of nodes on a zero-level surface of the level-set function.
- A triangulation procedure to connect the set of nodes into a triangulated surface.
The node placement procedure uses Monte-Carlo method to place the nodes and is implemented in Fortran. The surface triangulation procedure uses propagating front method (C++).
To run the Monte-Carlo meshing demos change to mc/demo/run directory and run
- appletviewer line.html
- appletviewer square.html
- appletviewer cube.html
To run the propagating front meshing demo change to pf directory and run
- appletviewer pfmesh.html