JIGSAW: An unstructured mesh generator


JIGSAW is an unstructured mesh generator and tessellation library; designed to generate high-quality triangulations and polyhedral decompositions of general planar, surface and volumetric domains. JIGSAW includes refinement-based algorithms for the construction of new meshes, optimisation-driven techniques for the improvement of existing grids, as well as routines to assemble (restricted) Delaunay tessellations, Voronoi complexes and Power diagrams.

This package provides a MATLAB / OCTAVE based scripting interface to the underlying JIGSAW mesh generator, including a range of additional facilities for file I/O, mesh visualisation and post-processing operations.

JIGSAW has been compiled and tested on various 64-bit Linux , Windows and Mac based platforms.


Ensure you have a c++ compiler and the cmake utility installed.
Clone/download + unpack this repository.
Run compile.m
Run example.m

Note: installation of JIGSAW requires a c++ compiler and the cmake utility. JIGSAW may also be installed as a conda package. See here for details.

Function Listing

See details.m for a description of the various functions available.

compile.m   - compile and install JIGSAW's c++ backend using cmake.
example.m   - a list of demo programs. 
initjig.m   - config. path and init. global constants.

jigsaw.m    - an interface to JIGSAW's mesh generation + optimisation workflow.
tripod.m    - an interface to JIGSAW's "restricted" Delaunay triangulation framework.
marche.m    - an interface to JIGSAW's "fast-marching" Eikonal-type "gradient-limiters".
tetris.m    - an interface to JIGSAW's "multi-level" meshing strategy.

loadmsh.m   - load *.msh files.
savemsh.m   - save *.msh files.
loadjig.m   - load *.jig files.
savejig.m   - save *.jig files.

project.m   - apply cartographic projection operators to mesh obj.

bisect.m    - refine a mesh obj. via bisection.
extrude.m   - create a mesh obj. via extrusion.

drawmesh.m  - draw mesh as 2- or 3-dim. "patch" object. 
drawcost.m  - draw cost metrics associated with a mesh.

Example Problems

The following set of example problems are available in example.m:

example(0); % simple 2-dim. examples to get started
example(1); % simple 3-dim. examples to get started
example(2); % frontal-delaunay methods in the plane
example(3); % frontal-delaunay methods for surfaces
example(4); % frontal-delaunay methods for volumes
example(5); % user-defined mesh-spacing constraints
example(6); % dealing with sharp-features in piecewise smooth domains
example(7); % dealing with sharp-features in piecewise smooth domains
example(8); % (re)mesh marching-cubes style outputs
example(9); % creating prismatic volumes via extrusion


This program may be freely redistributed under the condition that the copyright notices (including this entire header) are not removed, and no compensation is received through use of the software. Private, research, and institutional use is free. You may distribute modified versions of this code UNDER THE CONDITION THAT THIS CODE AND ANY MODIFICATIONS MADE TO IT IN THE SAME FILE REMAIN UNDER COPYRIGHT OF THE ORIGINAL AUTHOR, BOTH SOURCE AND OBJECT CODE ARE MADE FREELY AVAILABLE WITHOUT CHARGE, AND CLEAR NOTICE IS GIVEN OF THE MODIFICATIONS. Distribution of this code as part of a commercial system is permissible ONLY BY DIRECT ARRANGEMENT WITH THE AUTHOR. (If you are not directly supplying this code to a customer, and you are instead telling them how they can obtain it for free, then you are not required to make any arrangement with me.)

DISCLAIMER: Neither I nor: Columbia University, the Massachusetts Institute of Technology, the University of Sydney, nor the National Aeronautics and Space Administration warrant this code in any way whatsoever. This code is provided "as-is" to be used at your own risk.


There are a number of publications that describe the algorithms used in JIGSAW in detail. If you make use of JIGSAW in your work, please consider including a reference to the following:

[1] – Darren Engwirda: Generalised primal-dual grids for unstructured co-volume schemes, J. Comp. Phys., 375, pp. 155-176, https://doi.org/10.1016/j.jcp.2018.07.025, 2018.

[2] – Darren Engwirda, Conforming Restricted Delaunay Mesh Generation for Piecewise Smooth Complexes, Procedia Engineering, 163, pp. 84-96, https://doi.org/10.1016/j.proeng.2016.11.024, 2016.

[3] – Darren Engwirda, Voronoi-based Point-placement for Three-dimensional Delaunay-refinement, Procedia Engineering, 124, pp. 330-342, http://dx.doi.org/10.1016/j.proeng.2015.10.143, 2015.

[4] – Darren Engwirda, David Ivers, Off-centre Steiner points for Delaunay-refinement on curved surfaces, Computer-Aided Design, 72, pp. 157-171, http://dx.doi.org/10.1016/j.cad.2015.10.007, 2016.

[5] – Darren Engwirda, Locally-optimal Delaunay-refinement and optimisation-based mesh generation, Ph.D. Thesis, School of Mathematics and Statistics, The University of Sydney, http://hdl.handle.net/2123/13148, 2014.

© 版权声明
点赞691 分享
评论 抢沙发