{"id":34809864,"url":"https://github.com/dengwirda/jigsaw-matlab","last_synced_at":"2025-12-25T12:18:14.855Z","repository":{"id":48787817,"uuid":"52167928","full_name":"dengwirda/jigsaw-matlab","owner":"dengwirda","description":"MATLAB bindings for JIGSAW: a Delaunay-based unstructured mesh generator.","archived":false,"fork":false,"pushed_at":"2023-01-19T11:58:46.000Z","size":6707,"stargazers_count":78,"open_issues_count":0,"forks_count":28,"subscribers_count":18,"default_branch":"master","last_synced_at":"2025-04-11T09:52:06.774Z","etag":null,"topics":["delaunay-refinement","delaunay-triangulation","matlab","mesh-generation","scientific-computing","triangulation","voronoi-tessellation"],"latest_commit_sha":null,"homepage":"","language":"MATLAB","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/dengwirda.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.md","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2016-02-20T18:14:47.000Z","updated_at":"2025-03-25T08:19:16.000Z","dependencies_parsed_at":"2023-02-10T23:45:30.964Z","dependency_job_id":null,"html_url":"https://github.com/dengwirda/jigsaw-matlab","commit_stats":null,"previous_names":[],"tags_count":5,"template":false,"template_full_name":null,"purl":"pkg:github/dengwirda/jigsaw-matlab","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dengwirda%2Fjigsaw-matlab","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dengwirda%2Fjigsaw-matlab/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dengwirda%2Fjigsaw-matlab/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dengwirda%2Fjigsaw-matlab/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dengwirda","download_url":"https://codeload.github.com/dengwirda/jigsaw-matlab/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dengwirda%2Fjigsaw-matlab/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28029138,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-12-25T02:00:05.988Z","response_time":58,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["delaunay-refinement","delaunay-triangulation","matlab","mesh-generation","scientific-computing","triangulation","voronoi-tessellation"],"created_at":"2025-12-25T12:18:14.673Z","updated_at":"2025-12-25T12:18:14.846Z","avatar_url":"https://github.com/dengwirda.png","language":"MATLAB","funding_links":[],"categories":[],"sub_categories":[],"readme":"## `JIGSAW: An unstructured mesh generator`\n\n\u003cp align=\"middle\"\u003e\n  \u003cimg src = \"../master/external/jigsaw/img/bunny-TRIA3-1.png\" width=\"20%\" hspace=\"0.25%\"\u003e\n  \u003cimg src = \"../master/external/jigsaw/img/bunny-TRIA3-2.png\" width=\"20%\" hspace=\"0.25%\"\u003e\n  \u003cimg src = \"../master/external/jigsaw/img/bunny-TRIA3-3.png\" width=\"20%\" hspace=\"0.25%\"\u003e\n  \u003cimg src = \"../master/external/jigsaw/img/bunny-TRIA4-3.png\" width=\"20%\" hspace=\"0.25%\"\u003e\n\u003c/p\u003e\n\n`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.\n\nThis package provides a \u003ca href=\"http://www.mathworks.com\"\u003e`MATLAB`\u003c/a\u003e / \u003ca href=\"http://www.gnu.org/software/octave\"\u003e`OCTAVE`\u003c/a\u003e 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.\n\n`JIGSAW` has been compiled and tested on various `64-bit` `Linux` , `Windows` and `Mac` based platforms. \n\n### `Quickstart`\n\n    Ensure you have a c++ compiler and the cmake utility installed.\n    Clone/download + unpack this repository.\n    From MATLAB / OCTAVE:\n    Run compile.m\n    Run example.m\n    \nNote: installation of `JIGSAW` requires a `c++` compiler and the `cmake` utility. `JIGSAW` may also be installed as a `conda` package. See \u003ca href=\"https://github.com/dengwirda/jigsaw\"\u003ehere\u003c/a\u003e for details.\n    \n### `Function Listing`\n\nSee `details.m` for a description of the various functions available.\n\n    compile.m   - compile and install JIGSAW's c++ backend using cmake.\n    example.m   - a list of demo programs. \n    initjig.m   - config. path and init. global constants.\n\n    jigsaw.m    - an interface to JIGSAW's mesh generation + optimisation workflow.\n    tripod.m    - an interface to JIGSAW's \"restricted\" Delaunay triangulation framework.\n    marche.m    - an interface to JIGSAW's \"fast-marching\" Eikonal-type \"gradient-limiters\".\n    tetris.m    - an interface to JIGSAW's \"multi-level\" meshing strategy.\n    \n    loadmsh.m   - load *.msh files.\n    savemsh.m   - save *.msh files.\n    loadjig.m   - load *.jig files.\n    savejig.m   - save *.jig files.\n\n    project.m   - apply cartographic projection operators to mesh obj.\n\n    bisect.m    - refine a mesh obj. via bisection.\n    extrude.m   - create a mesh obj. via extrusion.\n    \n    drawmesh.m  - draw mesh as 2- or 3-dim. \"patch\" object. \n    drawcost.m  - draw cost metrics associated with a mesh.\n\n### `Example Problems`\n\nThe following set of example problems are available in `example.m`:\n\n    example(0); % simple 2-dim. examples to get started\n    example(1); % simple 3-dim. examples to get started\n    example(2); % frontal-delaunay methods in the plane\n    example(3); % frontal-delaunay methods for surfaces\n    example(4); % frontal-delaunay methods for volumes\n    example(5); % user-defined mesh-spacing constraints\n    example(6); % dealing with sharp-features in piecewise smooth domains\n    example(7); % dealing with sharp-features in piecewise smooth domains\n    example(8); % (re)mesh marching-cubes style outputs\n    example(9); % creating prismatic volumes via extrusion\n\n### `License`\n\nThis 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.) \n\n`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.\n\n### `References`\n\nThere 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:\n\n`[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.\n\n`[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.\n\n`[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.\n\n`[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.\n\n`[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.\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdengwirda%2Fjigsaw-matlab","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdengwirda%2Fjigsaw-matlab","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdengwirda%2Fjigsaw-matlab/lists"}