Tags :: Computational Geometry

Structured

These will be ones where all interior verticies are topologically alike. In graph theory, it is an induced subgraph of an infinite periodic graph such as a grid. Structured meshes offer simple and easy data access, but at the cost of domain adaptivity.

Unstructured

An unstructured mesh is a mesh where verticies may have arbitrarily varying local neighborhoods. Their improved adaptivity enables a better fit of complex domains, but introduces overhead for data access

Block Structured / Hybrid

These will be meshes formed by a number of small structured meshes combined in an overall unstructured pattern. E.g. a coarse mesh covering the domain where each face contains its own decomposition.

References

[1] Mark de Berg and Otfried Cheong and Marc J. van Kreveld and Mark H. Overmars, Computational geometry: algorithms and applications, 3rd Edition, Springer, 2008.

[2] J{\"{o}}rg{-}R{\"{u}}diger Sack and Jorge Urrutia, Handbook of Computational Geometry, North Holland / Elsevier, 2000.