Compare commits

..

No commits in common. "main" and "gh-pages" have entirely different histories.

7 changed files with 288 additions and 524 deletions

View File

@ -1,21 +0,0 @@
name: ci
on: [pull_request]
jobs:
lint:
runs-on: ubuntu-latest
steps:
- uses: actions/checkout@v4
with:
fetch-depth: 0 # fetch all history to avoid git-repo-age false negative
#
# git needed for awesome-lint
- run: sudo apt install git
- run: sudo npm install --global awesome-lint
- run: awesome-lint README.md
#
# - run: sudo apt install -y ruby
# - run: sudo gem install awesome_bot
# # Allow redirect for awesome.re
# - run: awesome_bot --white-list https://awesome.re,https://portal.nersc.gov/project/sparse/superlu/ README.md

121
LICENSE
View File

@ -1,121 +0,0 @@
Creative Commons Legal Code
CC0 1.0 Universal
CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE
LEGAL SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE AN
ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS
INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES
REGARDING THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS
PROVIDED HEREUNDER, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM
THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED
HEREUNDER.
Statement of Purpose
The laws of most jurisdictions throughout the world automatically confer
exclusive Copyright and Related Rights (defined below) upon the creator
and subsequent owner(s) (each and all, an "owner") of an original work of
authorship and/or a database (each, a "Work").
Certain owners wish to permanently relinquish those rights to a Work for
the purpose of contributing to a commons of creative, cultural and
scientific works ("Commons") that the public can reliably and without fear
of later claims of infringement build upon, modify, incorporate in other
works, reuse and redistribute as freely as possible in any form whatsoever
and for any purposes, including without limitation commercial purposes.
These owners may contribute to the Commons to promote the ideal of a free
culture and the further production of creative, cultural and scientific
works, or to gain reputation or greater distribution for their Work in
part through the use and efforts of others.
For these and/or other purposes and motivations, and without any
expectation of additional consideration or compensation, the person
associating CC0 with a Work (the "Affirmer"), to the extent that he or she
is an owner of Copyright and Related Rights in the Work, voluntarily
elects to apply CC0 to the Work and publicly distribute the Work under its
terms, with knowledge of his or her Copyright and Related Rights in the
Work and the meaning and intended legal effect of CC0 on those rights.
1. Copyright and Related Rights. A Work made available under CC0 may be
protected by copyright and related or neighboring rights ("Copyright and
Related Rights"). Copyright and Related Rights include, but are not
limited to, the following:
i. the right to reproduce, adapt, distribute, perform, display,
communicate, and translate a Work;
ii. moral rights retained by the original author(s) and/or performer(s);
iii. publicity and privacy rights pertaining to a person's image or
likeness depicted in a Work;
iv. rights protecting against unfair competition in regards to a Work,
subject to the limitations in paragraph 4(a), below;
v. rights protecting the extraction, dissemination, use and reuse of data
in a Work;
vi. database rights (such as those arising under Directive 96/9/EC of the
European Parliament and of the Council of 11 March 1996 on the legal
protection of databases, and under any national implementation
thereof, including any amended or successor version of such
directive); and
vii. other similar, equivalent or corresponding rights throughout the
world based on applicable law or treaty, and any national
implementations thereof.
2. Waiver. To the greatest extent permitted by, but not in contravention
of, applicable law, Affirmer hereby overtly, fully, permanently,
irrevocably and unconditionally waives, abandons, and surrenders all of
Affirmer's Copyright and Related Rights and associated claims and causes
of action, whether now known or unknown (including existing as well as
future claims and causes of action), in the Work (i) in all territories
worldwide, (ii) for the maximum duration provided by applicable law or
treaty (including future time extensions), (iii) in any current or future
medium and for any number of copies, and (iv) for any purpose whatsoever,
including without limitation commercial, advertising or promotional
purposes (the "Waiver"). Affirmer makes the Waiver for the benefit of each
member of the public at large and to the detriment of Affirmer's heirs and
successors, fully intending that such Waiver shall not be subject to
revocation, rescission, cancellation, termination, or any other legal or
equitable action to disrupt the quiet enjoyment of the Work by the public
as contemplated by Affirmer's express Statement of Purpose.
3. Public License Fallback. Should any part of the Waiver for any reason
be judged legally invalid or ineffective under applicable law, then the
Waiver shall be preserved to the maximum extent permitted taking into
account Affirmer's express Statement of Purpose. In addition, to the
extent the Waiver is so judged Affirmer hereby grants to each affected
person a royalty-free, non transferable, non sublicensable, non exclusive,
irrevocable and unconditional license to exercise Affirmer's Copyright and
Related Rights in the Work (i) in all territories worldwide, (ii) for the
maximum duration provided by applicable law or treaty (including future
time extensions), (iii) in any current or future medium and for any number
of copies, and (iv) for any purpose whatsoever, including without
limitation commercial, advertising or promotional purposes (the
"License"). The License shall be deemed effective as of the date CC0 was
applied by Affirmer to the Work. Should any part of the License for any
reason be judged legally invalid or ineffective under applicable law, such
partial invalidity or ineffectiveness shall not invalidate the remainder
of the License, and in such case Affirmer hereby affirms that he or she
will not (i) exercise any of his or her remaining Copyright and Related
Rights in the Work or (ii) assert any associated claims and causes of
action with respect to the Work, in either case contrary to Affirmer's
express Statement of Purpose.
4. Limitations and Disclaimers.
a. No trademark or patent rights held by Affirmer are waived, abandoned,
surrendered, licensed or otherwise affected by this document.
b. Affirmer offers the Work as-is and makes no representations or
warranties of any kind concerning the Work, express, implied,
statutory or otherwise, including without limitation warranties of
title, merchantability, fitness for a particular purpose, non
infringement, or the absence of latent or other defects, accuracy, or
the present or absence of errors, whether or not discoverable, all to
the greatest extent permissible under applicable law.
c. Affirmer disclaims responsibility for clearing rights of other persons
that may apply to the Work or any use thereof, including without
limitation any person's Copyright and Related Rights in the Work.
Further, Affirmer disclaims responsibility for obtaining any necessary
consents, permissions or other rights required for any use of the
Work.
d. Affirmer understands and acknowledges that Creative Commons is not a
party to this document and has no duty or obligation with respect to
this CC0 or use of the Work.

234
README.md
View File

@ -1,234 +0,0 @@
# Awesome Scientific Computing [![Awesome](https://awesome.re/badge.svg)](https://awesome.re)
[<img src="https://nschloe.github.io/awesome-scientific-computing/sunglasses.svg" align="right" width="30%">](#readme)
> Useful resources for scientific computing and numerical analysis.
Scientific computing and numerical analysis are research fields that aim to provide
methods for solving large-scale problems from various areas of science with the help of
computers. Typical problems are ordinary and partial differential equations (ODEs,
PDEs), their discretizations, and the solution of linear algebra problems arising from
them.
## Contents
- [Basic linear algebra](#basic-linear-algebra)
- [Multi-purpose toolkits](#multi-purpose-toolkits)
- [Finite Elements](#finite-elements)
- [Meshing](#meshing)
- [Data formats](#data-formats)
- [Sparse linear solvers](#sparse-linear-solvers)
- [Visualization](#visualization)
- [Other libraries and tools](#other-libraries-and-tools)
- [Community](#community)
## Basic linear algebra
- [BLAS](https://netlib.org/blas/) - Standard building blocks for performing basic vector and matrix operations.
(Fortran, public domain, [GitHub](https://github.com/Reference-LAPACK/lapack/tree/master/BLAS))
- [OpenBLAS](https://www.openblas.net) - Optimized BLAS library based on GotoBLAS2.
(C and Assembly, BSD, [GitHub](https://github.com/OpenMathLib/OpenBLAS))
- [BLIS](https://github.com/flame/blis) - High-performance BLAS-like dense linear algebra libraries.
(C, BSD, GitHub)
- [LAPACK](https://netlib.org/lapack/) - Routines for solving systems of linear equations, linear least-squares, eigenvalue problems, etc.
(Fortran, BSD, [GitHub](https://github.com/Reference-LAPACK/lapack))
- [Eigen](https://libeigen.gitlab.io/) - C++ template library for linear algebra.
(C++, MPL 2, [GitLab](https://gitlab.com/libeigen/eigen))
- [Ginkgo](https://ginkgo-project.github.io/) - High-performance manycore linear algebra library, focus on sparse systems.
(C++, BSD, [GitHub](https://github.com/ginkgo-project/ginkgo))
- [blaze](https://bitbucket.org/blaze-lib/blaze) - High-performance C++ math library for dense and sparse arithmetic.
(C++, BSD, Bitbucket)
## Multi-purpose toolkits
- [PETSc](https://petsc.org/release/) - Parallel solution of scientific applications modeled by PDEs.
(C, 2-clause BSD, [GitLab](https://gitlab.com/petsc/petsc))
- [DUNE Numerics](https://www.dune-project.org) - Toolbox for solving PDEs with grid-based methods.
(C++, GPL 2, [GitLab](https://gitlab.dune-project.org/core/))
- [SciPy](https://scipy.org) - Python modules for statistics, optimization, integration, linear algebra, etc.
(Python, mostly BSD, [GitHub](https://github.com/scipy/scipy/))
- [NumPy](https://numpy.org/) - Fundamental package needed for scientific computing with Python.
(Python, BSD, [GitHub](https://github.com/numpy/numpy))
- [DifferentialEquations.jl](https://docs.sciml.ai/DiffEqDocs/stable/) - Toolbox for solving different types of differential equations numerically. (Julia, MIT, [GitHub](https://github.com/SciML/DifferentialEquations.jl))
## Finite Elements
- [FEniCS](https://fenicsproject.org) - Computing platform for solving PDEs in Python and C++.
(C++/Python, LGPL 3, [GitHub](https://github.com/FEniCS)/[Bitbucket](https://bitbucket.org/fenics-project/))
- [libMesh](https://libmesh.github.io) - Framework for the numerical simulation of PDEs using unstructured discretizations.
(C++, LGPL 2.1, [GitHub](https://github.com/libMesh/libmesh))
- [deal.II](https://dealii.org) - Software library supporting the creation of finite element codes.
(C++, LGPL 2.1, [GitHub](https://github.com/dealii/dealii))
- [Netgen/NGSolve](https://ngsolve.org) - High performance multiphysics finite element software.
(C++, LGPL 2.1, [GitHub](https://github.com/NGSolve/netgen))
- [Firedrake](https://www.firedrakeproject.org) - Automated system for the solution of PDEs using the finite element method.
(Python, LGPL 3, [GitHub](https://github.com/firedrakeproject/firedrake))
- [MOOSE](https://mooseframework.inl.gov/) - Multiphysics Object Oriented Simulation Environment.
(C++, LGPL 2.1, [GitHub](https://github.com/idaholab/moose))
- [MFEM](https://mfem.org) - Free, lightweight, scalable C++ library for finite element methods.
(C++, BSD-3-Clause, [GitHub](https://github.com/mfem/mfem))
- [SfePy](https://sfepy.org) - Simple Finite Elements in Python.
(Python, BSD, [GitHub](https://github.com/sfepy/sfepy))
- [FreeFEM](https://freefem.org) - High level multiphysics-multimesh finite element language.
(C++, LGPL, [GitHub](https://github.com/FreeFem))
- [libceed](https://libceed.readthedocs.io/en/latest/index.html) - Code for Efficient Extensible Discretizations.
(C, 2-clause BSD, [GitHub](https://github.com/CEED/libCEED))
- [scikit-fem](https://github.com/kinnala/scikit-fem) - Simple finite element assemblers.
(Python, BSD/GPL, GitHub)
## Meshing
### Triangular and tetrahedral meshing
- [Gmsh](https://gmsh.info) - Three-dimensional finite element mesh generator with pre- and post-processing facilities.
(C++, GPL, [GitLab](https://gitlab.onelab.info/gmsh/gmsh))
- [pygmsh](https://github.com/nschloe/pygmsh) - Python interface for Gmsh.
(Python, GPL 3, GitHub)
- [MeshPy](https://mathema.tician.de/software/meshpy/) - Quality triangular and tetrahedral mesh generation.
(Python, MIT, [GitHub](https://github.com/inducer/meshpy))
- [CGAL](https://www.cgal.org) - Algorithms for computational geometry.
(C++, mixed LGPL/GPL, [GitHub](https://github.com/CGAL/cgal))
- [pygalmesh](https://github.com/meshpro/pygalmesh) - Python interface for CGAL's 3D meshing capabilities.
(Python, GPL 3, GitHub)
- [TetGen](https://www.wias-berlin.de/software/index.jsp?id=TetGen) - Quality tetrahedral mesh generator and 3D Delaunay triangulator.
(C++, AGPLv3)
- [Triangle](https://www.cs.cmu.edu/~quake/triangle.html) - Two-dimensional quality mesh generator and Delaunay triangulator.
(C, _nonfree software_)
- [distmesh](https://persson.berkeley.edu/distmesh/) - Simple generator for unstructured triangular and tetrahedral meshes.
(MATLAB, GPL 3)
- [trimesh](https://trimesh.org) - Loading and using triangular meshes with an emphasis on watertight surfaces.
(Python, MIT, [GitHub](https://github.com/mikedh/trimesh))
- [dmsh](https://github.com/meshpro/dmsh) - Simple generator for unstructured triangular meshes, inspired by distmesh.
(Python, proprietary, GitHub)
- [TetWild](https://arxiv.org/abs/1908.03581) - Generate tetrahedral meshes for triangular surface meshes.
(C++, GPL 3, [GitHub](https://github.com/Yixin-Hu/TetWild))
- [TriWild](https://cims.nyu.edu/gcl/papers/2019-TriWild.pdf) - Robust triangulation with curve constraints.
(C++, MPL 2, [GitHub](https://github.com/wildmeshing/TriWild))
- [fTetWild](https://arxiv.org/abs/1908.03581) - Same as TetWild, but faster.
(C++, MPL 2, [GitHub](https://github.com/wildmeshing/fTetWild))
- [SeismicMesh](https://github.com/krober10nd/SeismicMesh) - Parallel 2D/3D triangle/tetrahedral mesh generation with sliver removal.
(Python and C++, GPL 3, GitHub)
### Quadrilateral and hexahedral meshing
- [QuadriFlow](https://stanford.edu/~jingweih/papers/quadriflow/) - Scalable and robust quadrangulation from triangulation.
(C++, BSD, [GitHub](https://github.com/hjwdzh/QuadriFlow))
### Mesh tools
- [meshio](https://github.com/nschloe/meshio) - I/O for various mesh formats, file conversion.
(Python, MIT, GitHub)
- [MOAB](https://sigma.mcs.anl.gov/moab-library/) - Representing and evaluating mesh data.
(C++, mostly LGPL 3, [Bitbucket](https://bitbucket.org/fathomteam/moab/))
- [optimesh](https://github.com/meshpro/optimesh) - Triangular mesh smoothing.
(Python, proprietary, GitHub)
- [pmp-library](https://www.pmp-library.org/) - Polygon mesh processing library.
(C++, MIT with Employer Disclaimer, [GitHub](https://github.com/pmp-library/pmp-library/))
- [Mmg](https://www.mmgtools.org/) - Robust, open-source & multidisciplinary software for remeshing.
(C, LGPL 3, [GitHub](https://github.com/MmgTools/mmg))
- [meshplex](https://github.com/meshpro/meshplex) - Fast tools for simplex meshes.
(Python, proprietary, GitHub)
## Data formats
- [NetCDF](https://www.unidata.ucar.edu/software/netcdf) - Software libraries and data formats for array-oriented scientific data.
(C/C++/Fortran/Java/Python, [custom open-source
license](https://www.unidata.ucar.edu/software/netcdf/licensing),
[GitHub](https://github.com/Unidata/netcdf-c/))
- [HDF5](https://www.hdfgroup.org/solutions/hdf5/) - Data model, library, and file format for storing and managing data.
(C/Fortran, BSD, [GitHub](https://github.com/HDFGroup/hdf5))
- [XDMF](https://xdmf.org/) - eXtensible Data Model and Format for data from High Performance Computing codes.
(C++, [GitLab](https://gitlab.kitware.com/xdmf/xdmf))
- [Zarr](https://zarr.readthedocs.io/en/stable/) - Format for the storage of chunked, compressed, N-dimensional arrays.
(Python, MIT, [GitHub](https://github.com/zarr-developers/zarr-python))
## Sparse linear solvers
- [SuperLU](https://portal.nersc.gov/project/sparse/superlu/) - Direct solution of large, sparse, nonsymmetric systems of linear equations.
(C, mostly BSD, [GitHub](https://github.com/xiaoyeli/superlu))
- [PyAMG](https://pyamg.readthedocs.io/en/latest/) - Algebraic Multigrid Solvers in Python.
(Python, MIT, [GitHub](https://github.com/pyamg/pyamg))
- [hypre](https://computing.llnl.gov/projects/hypre-scalable-linear-solvers-multigrid-methods) - Library of high-performance preconditioners and solvers.
(C, Apache 2.0/MIT, [GitHub](https://github.com/hypre-space/hypre))
## Visualization
- [ParaView](https://www.paraview.org) - Multi-platform data analysis and visualization application based on VTK.
(C++, BSD, [GitLab](https://gitlab.kitware.com/paraview/paraview))
- [VTK](https://vtk.org/) - Process images and create 3D computer graphics.
(C++, BSD, [GitLab](https://gitlab.kitware.com/vtk/vtk))
- [Mayavi](https://docs.enthought.com/mayavi/mayavi/) - 3D scientific data visualization and plotting in Python.
(Python, BSD, [GitHub](https://github.com/enthought/mayavi))
- [Polyscope](https://polyscope.run/) - Viewer and user interface for 3D geometry processing.
(C++, MIT, [GitHub](https://github.com/nmwsharp/polyscope))
- [PyVista](https://docs.pyvista.org/) - 3D plotting and mesh analysis through a streamlined interface for VTK.
(Python, MIT, [GitHub](https://github.com/pyvista/pyvista))
- [vedo](https://vedo.embl.es) - Library for scientific analysis and visualization of 3D objects based on VTK.
(Python, MIT, [GitHub](https://github.com/marcomusy/vedo))
- [yt](https://yt-project.org/) - Toolkit for analysis and visualization of volumetric data.
(Python, BSD, [GitHub](https://github.com/yt-project/yt))
- [F3D](https://f3d.app/) - Cross-platform, fast, and minimalist 3D viewer with scientific visualization tools.
(C++, BSD, [GitHub](https://github.com/f3d-app/f3d))
- [TTK](https://topology-tool-kit.github.io/) - Topological data analysis and visualization.
(C++/Python, BSD, [GitHub](https://github.com/topology-tool-kit/ttk))
- [morphologica](https://github.com/ABRG-Models/morphologica) - Header-only, modern OpenGL code to visualize numerical simulations at runtime. (C++, Apache 2.0, GitHub)
## Other libraries and tools
- [FFTW](http://www.fftw.org) - Discrete Fourier transforms in one or more dimensions, of arbitrary input size, real and complex.
(C, GPL2, [GitHub](https://github.com/FFTW/fftw3))
- [Qhull](http://www.qhull.org) - Convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, etc.
(C/C++, [custom open source license](http://www.qhull.org/COPYING.txt),
[GitHub](https://github.com/qhull/qhull/))
- [GSL](https://www.gnu.org/software/gsl/) - Random number generators, special functions, and least-squares fitting etc.
(C/C++, GPL 3, [Savannah](https://savannah.gnu.org/projects/gsl))
- [OpenFOAM](https://www.openfoam.com) - Free, open source CFD (computational fluid dynamics) software.
(C++, GPL 3, [GitHub](https://github.com/OpenFOAM/OpenFOAM-dev))
- [quadpy](https://github.com/sigma-py/quadpy) - Numerical integration (quadrature, cubature) in Python.
(Python, proprietary, GitHub)
- [FiPy](https://www.ctcms.nist.gov/fipy/) - Finite-volume PDE solver.
(Python, [custom open-source
license](https://www.nist.gov/open/copyright-fair-use-and-licensing-statements-srd-data-software-and-technical-series-publications),
[GitHub](https://github.com/usnistgov/fipy))
- [accupy](https://github.com/sigma-py/accupy) - Accurate sums and dot products for Python.
(Python, GPL 3, GitHub)
- [SLEPc](https://slepc.upv.es) - Scalable Library for Eigenvalue Problem Computations.
(C, 2-clause BSD, [GitLab](https://gitlab.com/slepc/slepc))
- [Chebfun](https://www.chebfun.org/) - Computing with functions to about 15-digit accuracy.
(MATLAB, BSD, [GitHub](https://github.com/chebfun/chebfun))
- [pyMOR](https://pymor.org/) - Model Order Reduction with Python.
(Python, 2-clause BSD, [GitHub](https://github.com/pymor/pymor/))
- [cvxpy](https://www.cvxpy.org/) - Modeling language for convex optimization problems.
(Python, Apache 2.0, [GitHub](https://github.com/cvxpy/cvxpy))
- [PyWavelets](https://pywavelets.readthedocs.io/en/latest/) - Wavelet transforms in Python.
(Python, MIT, [GitHub](https://github.com/PyWavelets/pywt))
- [NFFT](https://www-user.tu-chemnitz.de/~potts/nfft/) - Nonequispaced fast Fourier transform.
(C/MATLAB, GPL 2, [GitHub](https://github.com/NFFT/nfft))
- [preCICE](https://precice.org/) - Coupling library for partitioned multi-physics simulations (FSI, CHT, and more).
(C++, LGPL 3, [GitHub](https://github.com/precice/))
- [orthopy](https://github.com/sigma-py/orthopy) - Compute orthogonal polynomials efficiently.
(Python, proprietary, GitHub)
- [pyGAM](https://pygam.readthedocs.io/en/latest/) - Generalized Additive Models in Python.
(Python, Apache 2.0, [GitHub](https://github.com/dswah/pyGAM))
- [Dedalus](https://dedalus-project.org/) - Solve partial differential equations with spectral methods.
(Python, GPL 3, [GitHub](https://github.com/DedalusProject/dedalus))
- [PyGMO](https://esa.github.io/pygmo/) - Massively parallel optimization.
(Python/C++, MPL 2, [GitHub](https://github.com/esa/pygmo2))
- [shenfun](https://shenfun.readthedocs.io/en/latest/) - High-performance Python library for the spectral Galerkin method.
(Python, BSD-2, [GitHub](https://github.com/spectralDNS/shenfun))
- [PyDMD](https://github.com/mathLab/PyDMD) - Dynamic Mode Decomposition (DMD) in Python.
(Python, MIT, GitHub)
- [HPDDM](https://github.com/hpddm/hpddm) - High-performance unified framework for domain decomposition methods.
(C++, LGPL 3, GitHub)
## Community
- [SciComp StackExchange](https://scicomp.stackexchange.com/) - Computational Science on the StackExchange network.
- [Wolfgang Bangerth's video class](https://www.math.colostate.edu/~bangerth/videos.html) - MATH 676: Finite element methods in scientific computing.
- [Nick Higham's blog](https://nhigham.com/) - Mostly on MATLAB, general computing advice.
- [Nick Trefethen's Video Lectures](https://people.maths.ox.ac.uk/trefethen/videos.html) - 36 video lectures on approximation theory/practice and scientific computing.
- [John D. Cook's blog](https://www.johndcook.com/blog/) - Feats of scientific computing.
- [Jack Dongarra's software list](https://netlib.org/utk/people/JackDongarra/la-sw.html) - List of freely available software for the solution of linear algebra problems.
- [NA Digest](https://netlib.org/na-digest-html/) - Collection of articles on topics related to numerical analysis and those who practice it.
- [Gabriel Peyré on Bluesky](https://bsky.app/profile/gabrielpeyre.bsky.social) - One post a day on computational mathematics.
- [Discord: Numerical Software](https://discord.com/invite/hnTJ5MRX2Y) - Discord messaging server on numerical software.

View File

@ -1,27 +0,0 @@
Ensure your pull request adheres to the following guidelines:
- Only awesome is awesome. Only put stuff on the list that you or another
contributor can personally recommend.
- **If you just created something, wait at least 30 days before submitting.**
This is to give it some time to mature and ensure it's not just a
publish-and-forget type of project.
- If you submit a project that is similar to an existing project in the list,
argue how it's better.
- Search previous suggestions before making a new one, as yours may be a
duplicate.
- Suggested packages should be tested and documented.
- Make an individual pull request for each suggestion.
- Use the following format:
`[package](link) - Description. [language, license, repo]`
- Additions should be added to the bottom of the relevant category.
- Keep descriptions short and simple, but descriptive.
- Start the description with a capital and end with a full stop/period.
- Don't start the description with `A` or `An`.
- Check your spelling and grammar.
- Make sure your text editor is set to remove trailing whitespace.
- The pull request should have a useful title and include a link to the package
and why it should be included.
- New categories or improvements to the existing categorization are welcome,
but should be done in a separate pull request.
Thank you for your suggestion!

View File

@ -1,6 +0,0 @@
default:
@echo "\"just lint\"?"
lint:
awesome-lint README.md
awesome_bot --white-list https://awesome.re README.md

View File

@ -1,115 +0,0 @@
# -*- coding: utf-8 -*-
#
import os.path
import dmsh
import meshio
import optimesh
import numpy
# from dolfin import (
# Mesh,
# XDMFFile,
# mpi_comm_world,
# Constant,
# DirichletBC,
# inner,
# grad,
# dx,
# FunctionSpace,
# TestFunction,
# TrialFunction,
# Function,
# solve
# )
def _create_mesh(filename):
poly = dmsh.Polygon(
[
[-295.0, 0.0],
[-160.0, 0.0],
[-50.0, 110.0],
[-50.0, 190.0],
[+50.0, 190.0],
[+50.0, 110.0],
[+160.0, 0.0],
[+295.0, 0.0],
[+405.0, 110.0],
[+405.0, 235.0],
[+200.0, 430.0],
[+170.0, 400.0],
[+355.0, 235.0],
[-355.0, 235.0],
[-170.0, 400.0],
[-200.0, 430.0],
[-405.0, 235.0],
[-405.0, 110.0],
]
)
geo = dmsh.Union(
[
poly,
dmsh.Circle([-295.0, 110.0], 110.0),
dmsh.Circle([+295.0, 110.0], 110.0),
dmsh.Circle([-160.0, 110.0], 110.0),
dmsh.Circle([+160.0, 110.0], 110.0),
]
)
X, cells = dmsh.generate(
geo,
35.0,
# show=True
)
X, cells = optimesh.cvt.quasi_newton_uniform_full(
X, cells, 1.0e-3, 100, verbose=True
)
X = numpy.column_stack([X[:, 0], X[:, 1], numpy.zeros(X.shape[0])])
meshio.write_points_cells(filename, X, {"triangle": cells})
return
def _main():
this_dir = os.path.dirname(os.path.abspath(__file__))
filename = os.path.join(this_dir, "sunglasses.xdmf")
_create_mesh(filename)
# mesh = Mesh()
# with XDMFFile(mpi_comm_world(), filename) as f:
# f.read(mesh)
# # Create mesh and define function space
# V = FunctionSpace(mesh, "Lagrange", 1)
# def boundary(x):
# return x[1] < 1.0e-10
# # Define boundary condition
# u0 = Constant(0.0)
# bc = DirichletBC(V, u0, "on_boundary")
# # Define variational problem
# u = TrialFunction(V)
# v = TestFunction(V)
# f = Constant(1.0)
# a = inner(grad(u), grad(v)) * dx
# L = f * v * dx
# # Compute solution
# u = Function(V)
# solve(a == L, u, bc)
# filename = os.path.join(this_dir, "solution.xdmf")
# xf = XDMFFile(filename)
# xf.write(u)
return
if __name__ == "__main__":
_main()

288
sunglasses.svg Normal file
View File

@ -0,0 +1,288 @@
<svg version="1.1" viewBox="-405.000 0.000 810.000 430.000" xmlns="http://www.w3.org/2000/svg">
<style>polygon {fill: #fc60a8ff; stroke: white; stroke-width: 2.0;}</style>
<polygon points="-374.193,255.971 -405.000,278.088 -375.442,297.537"/>
<polygon points="376.830,220.104 377.749,264.065 405.000,239.171"/>
<polygon points="170.000,30.000 198.798,55.684 200.000,0.000"/>
<polygon points="-376.822,218.347 -374.193,255.971 -341.079,231.876"/>
<polygon points="-405.000,278.088 -405.000,320.000 -375.442,297.537"/>
<polygon points="80.544,273.589 50.000,293.371 85.880,310.315"/>
<polygon points="115.168,291.788 80.544,273.589 85.880,310.315"/>
<polygon points="52.282,195.000 50.000,240.000 78.862,228.524"/>
<polygon points="16.279,195.000 50.000,240.000 52.282,195.000"/>
<polygon points="50.000,240.000 80.544,273.589 78.862,228.524"/>
<polygon points="377.749,264.065 342.756,281.629 373.243,302.856"/>
<polygon points="342.756,281.629 377.749,264.065 352.078,246.690"/>
<polygon points="377.749,264.065 405.000,281.321 405.000,239.171"/>
<polygon points="405.000,281.321 373.243,302.856 405.000,320.000"/>
<polygon points="405.000,281.321 377.749,264.065 373.243,302.856"/>
<polygon points="234.501,32.818 198.798,55.684 228.444,82.126"/>
<polygon points="267.549,64.254 234.501,32.818 228.444,82.126"/>
<polygon points="198.798,55.684 234.501,32.818 200.000,0.000"/>
<polygon points="259.994,228.963 241.417,195.000 224.261,229.153"/>
<polygon points="295.832,227.198 332.979,222.412 315.055,195.000"/>
<polygon points="332.979,222.412 355.000,195.000 315.055,195.000"/>
<polygon points="355.000,195.000 376.830,220.104 405.000,195.000"/>
<polygon points="376.830,220.104 405.000,239.171 405.000,195.000"/>
<polygon points="376.830,220.104 377.749,264.065 352.078,246.690"/>
<polygon points="376.830,220.104 332.979,222.412 352.078,246.690"/>
<polygon points="332.979,222.412 376.830,220.104 355.000,195.000"/>
<polygon points="364.832,156.792 355.000,195.000 405.000,195.000"/>
<polygon points="-405.000,237.103 -405.000,278.088 -374.193,255.971"/>
<polygon points="-376.822,218.347 -405.000,237.103 -374.193,255.971"/>
<polygon points="-405.000,237.103 -376.822,218.347 -405.000,195.000"/>
<polygon points="-345.517,273.435 -374.193,255.971 -375.442,297.537"/>
<polygon points="-374.193,255.971 -345.517,273.435 -341.079,231.876"/>
<polygon points="399.800,353.421 367.085,340.808 384.784,383.551"/>
<polygon points="373.243,302.856 367.085,340.808 405.000,320.000"/>
<polygon points="367.085,340.808 399.800,353.421 405.000,320.000"/>
<polygon points="241.982,396.729 279.938,396.555 257.461,364.723"/>
<polygon points="295.000,430.000 317.920,391.596 279.938,396.555"/>
<polygon points="183.900,361.793 202.306,329.045 164.171,328.941"/>
<polygon points="145.792,360.570 183.900,361.793 164.171,328.941"/>
<polygon points="145.792,360.570 108.196,370.382 133.870,394.137"/>
<polygon points="169.273,394.961 145.792,360.570 133.870,394.137"/>
<polygon points="145.792,360.570 169.273,394.961 183.900,361.793"/>
<polygon points="317.920,391.596 328.542,424.761 358.743,409.649"/>
<polygon points="328.542,424.761 317.920,391.596 295.000,430.000"/>
<polygon points="294.347,362.433 271.947,332.306 257.461,364.723"/>
<polygon points="279.938,396.555 294.347,362.433 257.461,364.723"/>
<polygon points="294.347,362.433 317.920,391.596 328.287,351.354"/>
<polygon points="317.920,391.596 294.347,362.433 279.938,396.555"/>
<polygon points="265.549,297.176 303.025,324.437 304.691,290.794"/>
<polygon points="303.025,324.437 265.549,297.176 271.947,332.306"/>
<polygon points="303.025,324.437 294.347,362.433 328.287,351.354"/>
<polygon points="294.347,362.433 303.025,324.437 271.947,332.306"/>
<polygon points="50.000,293.371 50.000,320.000 85.880,310.315"/>
<polygon points="150.016,296.719 171.474,262.795 137.128,260.959"/>
<polygon points="115.168,291.788 150.016,296.719 137.128,260.959"/>
<polygon points="104.376,255.066 115.168,291.788 137.128,260.959"/>
<polygon points="115.168,291.788 104.376,255.066 80.544,273.589"/>
<polygon points="80.544,273.589 104.376,255.066 78.862,228.524"/>
<polygon points="-198.798,55.684 -170.000,30.000 -200.000,0.000"/>
<polygon points="-234.501,32.818 -198.798,55.684 -200.000,0.000"/>
<polygon points="80.544,273.589 50.000,265.606 50.000,293.371"/>
<polygon points="50.000,240.000 50.000,265.606 80.544,273.589"/>
<polygon points="342.756,281.629 337.992,316.135 373.243,302.856"/>
<polygon points="337.992,316.135 367.085,340.808 373.243,302.856"/>
<polygon points="367.085,340.808 337.992,316.135 328.287,351.354"/>
<polygon points="337.992,316.135 303.025,324.437 328.287,351.354"/>
<polygon points="337.992,316.135 342.756,281.629 304.691,290.794"/>
<polygon points="303.025,324.437 337.992,316.135 304.691,290.794"/>
<polygon points="90.727,195.000 52.282,195.000 78.862,228.524"/>
<polygon points="277.947,195.000 295.832,227.198 315.055,195.000"/>
<polygon points="259.994,228.963 277.947,195.000 241.417,195.000"/>
<polygon points="277.947,195.000 259.994,228.963 295.832,227.198"/>
<polygon points="259.177,109.536 290.912,137.840 299.844,94.974"/>
<polygon points="267.549,64.254 259.177,109.536 299.844,94.974"/>
<polygon points="259.177,109.536 267.549,64.254 228.444,82.126"/>
<polygon points="316.547,256.396 332.979,222.412 295.832,227.198"/>
<polygon points="342.756,281.629 316.547,256.396 304.691,290.794"/>
<polygon points="316.547,256.396 342.756,281.629 352.078,246.690"/>
<polygon points="332.979,222.412 316.547,256.396 352.078,246.690"/>
<polygon points="290.912,137.840 332.105,125.661 299.844,94.974"/>
<polygon points="-355.000,195.000 -376.822,218.347 -341.079,231.876"/>
<polygon points="-376.822,218.347 -355.000,195.000 -405.000,195.000"/>
<polygon points="-341.413,307.679 -345.517,273.435 -375.442,297.537"/>
<polygon points="-348.936,368.784 -384.744,383.609 -360.398,408.448"/>
<polygon points="-172.139,394.790 -160.000,430.000 -136.087,394.515"/>
<polygon points="367.085,340.808 351.538,375.112 384.784,383.551"/>
<polygon points="351.538,375.112 367.085,340.808 328.287,351.354"/>
<polygon points="384.784,383.551 351.538,375.112 358.743,409.649"/>
<polygon points="351.538,375.112 317.920,391.596 358.743,409.649"/>
<polygon points="317.920,391.596 351.538,375.112 328.287,351.354"/>
<polygon points="260.583,430.000 295.000,430.000 279.938,396.555"/>
<polygon points="241.982,396.729 260.583,430.000 279.938,396.555"/>
<polygon points="226.085,430.000 260.583,430.000 241.982,396.729"/>
<polygon points="123.491,329.614 115.168,291.788 85.880,310.315"/>
<polygon points="145.792,360.570 123.491,329.614 108.196,370.382"/>
<polygon points="123.491,329.614 145.792,360.570 164.171,328.941"/>
<polygon points="150.016,296.719 123.491,329.614 164.171,328.941"/>
<polygon points="123.491,329.614 150.016,296.719 115.168,291.788"/>
<polygon points="94.767,408.570 126.288,424.707 133.870,394.137"/>
<polygon points="108.196,370.382 94.767,408.570 133.870,394.137"/>
<polygon points="94.767,408.570 108.196,370.382 70.473,383.913"/>
<polygon points="221.142,362.594 202.306,329.045 183.900,361.793"/>
<polygon points="221.142,362.594 241.982,396.729 257.461,364.723"/>
<polygon points="202.306,329.045 238.610,329.349 225.752,296.155"/>
<polygon points="238.610,329.349 265.549,297.176 225.752,296.155"/>
<polygon points="265.549,297.176 238.610,329.349 271.947,332.306"/>
<polygon points="221.142,362.594 238.610,329.349 202.306,329.045"/>
<polygon points="271.947,332.306 238.610,329.349 257.461,364.723"/>
<polygon points="238.610,329.349 221.142,362.594 257.461,364.723"/>
<polygon points="126.288,424.707 160.000,430.000 133.870,394.137"/>
<polygon points="160.000,430.000 169.273,394.961 133.870,394.137"/>
<polygon points="169.273,394.961 160.000,430.000 192.563,430.000"/>
<polygon points="-261.312,430.000 -227.272,430.000 -246.063,395.416"/>
<polygon points="-160.000,430.000 -125.895,424.579 -136.087,394.515"/>
<polygon points="-125.895,424.579 -94.910,408.675 -136.087,394.515"/>
<polygon points="259.994,228.963 280.108,262.033 295.832,227.198"/>
<polygon points="280.108,262.033 265.549,297.176 304.691,290.794"/>
<polygon points="316.547,256.396 280.108,262.033 304.691,290.794"/>
<polygon points="280.108,262.033 316.547,256.396 295.832,227.198"/>
<polygon points="150.016,296.719 187.489,296.217 171.474,262.795"/>
<polygon points="187.489,296.217 202.306,329.045 225.752,296.155"/>
<polygon points="202.306,329.045 187.489,296.217 164.171,328.941"/>
<polygon points="187.489,296.217 150.016,296.719 164.171,328.941"/>
<polygon points="207.430,262.900 187.489,296.217 225.752,296.155"/>
<polygon points="187.489,296.217 207.430,262.900 171.474,262.795"/>
<polygon points="115.942,224.652 104.376,255.066 137.128,260.959"/>
<polygon points="104.376,255.066 115.942,224.652 78.862,228.524"/>
<polygon points="115.942,224.652 90.727,195.000 78.862,228.524"/>
<polygon points="90.727,195.000 115.942,224.652 130.616,195.000"/>
<polygon points="-80.474,228.971 -55.729,195.000 -94.511,195.000"/>
<polygon points="-227.158,362.095 -207.813,329.561 -247.237,329.637"/>
<polygon points="-228.444,82.126 -198.798,55.684 -234.501,32.818"/>
<polygon points="-282.495,263.551 -316.120,261.196 -306.308,297.610"/>
<polygon points="-345.517,273.435 -306.308,297.610 -316.120,261.196"/>
<polygon points="-345.517,273.435 -306.308,297.610 -341.413,307.679"/>
<polygon points="-345.517,273.435 -316.120,261.196 -341.079,231.876"/>
<polygon points="-266.977,297.205 -282.495,263.551 -306.308,297.610"/>
<polygon points="-266.977,297.205 -286.859,329.885 -247.237,329.637"/>
<polygon points="-286.859,329.885 -266.977,297.205 -306.308,297.610"/>
<polygon points="-266.977,297.205 -246.545,263.360 -282.495,263.551"/>
<polygon points="-0.198,239.551 50.000,240.000 16.279,195.000"/>
<polygon points="-19.725,195.000 -0.198,239.551 16.279,195.000"/>
<polygon points="188.128,228.799 207.430,262.900 224.261,229.153"/>
<polygon points="207.430,262.900 188.128,228.799 171.474,262.795"/>
<polygon points="188.128,228.799 204.787,195.000 167.868,195.000"/>
<polygon points="241.417,195.000 204.787,195.000 224.261,229.153"/>
<polygon points="204.787,195.000 188.128,228.799 224.261,229.153"/>
<polygon points="323.031,166.487 332.105,125.661 290.912,137.840"/>
<polygon points="332.105,125.661 323.031,166.487 364.832,156.792"/>
<polygon points="364.832,156.792 323.031,166.487 355.000,195.000"/>
<polygon points="-320.077,195.000 -355.000,195.000 -341.079,231.876"/>
<polygon points="-299.844,94.974 -290.912,137.840 -259.177,109.536"/>
<polygon points="-355.000,195.000 -364.832,156.792 -405.000,195.000"/>
<polygon points="-364.832,156.792 -355.000,195.000 -323.031,166.487"/>
<polygon points="-384.744,383.609 -367.267,336.660 -399.556,354.177"/>
<polygon points="-348.936,368.784 -367.267,336.660 -384.744,383.609"/>
<polygon points="-405.000,320.000 -367.267,336.660 -375.442,297.537"/>
<polygon points="-367.267,336.660 -405.000,320.000 -399.556,354.177"/>
<polygon points="-367.267,336.660 -341.413,307.679 -375.442,297.537"/>
<polygon points="-265.789,362.340 -286.859,329.885 -304.084,363.734"/>
<polygon points="-286.859,329.885 -265.789,362.340 -247.237,329.637"/>
<polygon points="-265.789,362.340 -227.158,362.095 -247.237,329.637"/>
<polygon points="-227.158,362.095 -265.789,362.340 -246.063,395.416"/>
<polygon points="-286.859,329.885 -325.815,336.947 -304.084,363.734"/>
<polygon points="-325.815,336.947 -348.936,368.784 -304.084,363.734"/>
<polygon points="-341.413,307.679 -325.815,336.947 -306.308,297.610"/>
<polygon points="-325.815,336.947 -286.859,329.885 -306.308,297.610"/>
<polygon points="-367.267,336.660 -325.815,336.947 -341.413,307.679"/>
<polygon points="-325.815,336.947 -367.267,336.660 -348.936,368.784"/>
<polygon points="-208.950,395.267 -227.158,362.095 -246.063,395.416"/>
<polygon points="-227.272,430.000 -208.950,395.267 -246.063,395.416"/>
<polygon points="87.466,344.106 123.491,329.614 85.880,310.315"/>
<polygon points="123.491,329.614 87.466,344.106 108.196,370.382"/>
<polygon points="50.000,320.000 87.466,344.106 85.880,310.315"/>
<polygon points="87.466,344.106 50.000,320.000 55.277,353.660"/>
<polygon points="87.466,344.106 55.277,353.660 70.473,383.913"/>
<polygon points="108.196,370.382 87.466,344.106 70.473,383.913"/>
<polygon points="169.273,394.961 205.416,395.591 183.900,361.793"/>
<polygon points="205.416,395.591 221.142,362.594 183.900,361.793"/>
<polygon points="205.416,395.591 169.273,394.961 192.563,430.000"/>
<polygon points="221.142,362.594 205.416,395.591 241.982,396.729"/>
<polygon points="226.085,430.000 205.416,395.591 192.563,430.000"/>
<polygon points="205.416,395.591 226.085,430.000 241.982,396.729"/>
<polygon points="-295.000,430.000 -321.778,393.355 -328.773,424.687"/>
<polygon points="-348.936,368.784 -321.778,393.355 -304.084,363.734"/>
<polygon points="-321.778,393.355 -360.398,408.448 -328.773,424.687"/>
<polygon points="-321.778,393.355 -348.936,368.784 -360.398,408.448"/>
<polygon points="244.089,263.637 280.108,262.033 259.994,228.963"/>
<polygon points="244.089,263.637 259.994,228.963 224.261,229.153"/>
<polygon points="207.430,262.900 244.089,263.637 224.261,229.153"/>
<polygon points="244.089,263.637 207.430,262.900 225.752,296.155"/>
<polygon points="265.549,297.176 244.089,263.637 225.752,296.155"/>
<polygon points="280.108,262.033 244.089,263.637 265.549,297.176"/>
<polygon points="-94.910,408.675 -109.914,371.055 -136.087,394.515"/>
<polygon points="-109.914,371.055 -94.910,408.675 -70.615,384.112"/>
<polygon points="-155.328,228.390 -134.655,195.000 -172.231,195.000"/>
<polygon points="-267.549,64.254 -228.444,82.126 -234.501,32.818"/>
<polygon points="-267.549,64.254 -299.844,94.974 -259.177,109.536"/>
<polygon points="-228.444,82.126 -267.549,64.254 -259.177,109.536"/>
<polygon points="-228.526,229.051 -209.422,195.000 -246.582,195.000"/>
<polygon points="-207.813,329.561 -228.291,296.918 -247.237,329.637"/>
<polygon points="-228.291,296.918 -266.977,297.205 -247.237,329.637"/>
<polygon points="-228.291,296.918 -246.545,263.360 -266.977,297.205"/>
<polygon points="-80.474,228.971 -50.000,240.000 -55.729,195.000"/>
<polygon points="-50.000,240.000 -19.725,195.000 -55.729,195.000"/>
<polygon points="-50.000,240.000 -0.198,239.551 -19.725,195.000"/>
<polygon points="-50.000,240.000 -80.474,228.971 -81.140,273.749"/>
<polygon points="152.107,228.088 188.128,228.799 167.868,195.000"/>
<polygon points="152.107,228.088 167.868,195.000 130.616,195.000"/>
<polygon points="115.942,224.652 152.107,228.088 130.616,195.000"/>
<polygon points="152.107,228.088 115.942,224.652 137.128,260.959"/>
<polygon points="171.474,262.795 152.107,228.088 137.128,260.959"/>
<polygon points="188.128,228.799 152.107,228.088 171.474,262.795"/>
<polygon points="-290.912,137.840 -332.105,125.661 -323.031,166.487"/>
<polygon points="-332.105,125.661 -290.912,137.840 -299.844,94.974"/>
<polygon points="-332.105,125.661 -364.832,156.792 -323.031,166.487"/>
<polygon points="-193.243,430.000 -208.950,395.267 -227.272,430.000"/>
<polygon points="-172.139,394.790 -193.243,430.000 -160.000,430.000"/>
<polygon points="-208.950,395.267 -193.243,430.000 -172.139,394.790"/>
<polygon points="-283.518,395.987 -321.778,393.355 -295.000,430.000"/>
<polygon points="-265.789,362.340 -283.518,395.987 -246.063,395.416"/>
<polygon points="-283.518,395.987 -265.789,362.340 -304.084,363.734"/>
<polygon points="-321.778,393.355 -283.518,395.987 -304.084,363.734"/>
<polygon points="-283.518,395.987 -295.000,430.000 -261.312,430.000"/>
<polygon points="-283.518,395.987 -261.312,430.000 -246.063,395.416"/>
<polygon points="-155.328,228.390 -118.604,225.057 -134.655,195.000"/>
<polygon points="-134.655,195.000 -118.604,225.057 -94.511,195.000"/>
<polygon points="-118.604,225.057 -80.474,228.971 -94.511,195.000"/>
<polygon points="-118.604,225.057 -155.328,228.390 -139.217,261.515"/>
<polygon points="-283.455,195.000 -265.422,229.158 -246.582,195.000"/>
<polygon points="-265.422,229.158 -228.526,229.051 -246.582,195.000"/>
<polygon points="-246.545,263.360 -265.422,229.158 -282.495,263.551"/>
<polygon points="-228.526,229.051 -265.422,229.158 -246.545,263.360"/>
<polygon points="-228.526,229.051 -191.784,229.056 -209.422,195.000"/>
<polygon points="-209.422,195.000 -191.784,229.056 -172.231,195.000"/>
<polygon points="-191.784,229.056 -155.328,228.390 -172.231,195.000"/>
<polygon points="-50.000,265.545 -81.140,273.749 -50.000,293.551"/>
<polygon points="-50.000,265.545 -50.000,240.000 -81.140,273.749"/>
<polygon points="-188.265,361.753 -167.705,329.610 -207.813,329.561"/>
<polygon points="-188.265,361.753 -207.813,329.561 -227.158,362.095"/>
<polygon points="-208.950,395.267 -188.265,361.753 -227.158,362.095"/>
<polygon points="-188.265,361.753 -208.950,395.267 -172.139,394.790"/>
<polygon points="-106.084,255.713 -118.604,225.057 -139.217,261.515"/>
<polygon points="-80.474,228.971 -106.084,255.713 -81.140,273.749"/>
<polygon points="-118.604,225.057 -106.084,255.713 -80.474,228.971"/>
<polygon points="-320.077,195.000 -302.506,227.994 -283.455,195.000"/>
<polygon points="-302.506,227.994 -265.422,229.158 -283.455,195.000"/>
<polygon points="-302.506,227.994 -320.077,195.000 -341.079,231.876"/>
<polygon points="-316.120,261.196 -302.506,227.994 -341.079,231.876"/>
<polygon points="-302.506,227.994 -316.120,261.196 -282.495,263.551"/>
<polygon points="-265.422,229.158 -302.506,227.994 -282.495,263.551"/>
<polygon points="-173.886,263.420 -151.828,297.673 -139.217,261.515"/>
<polygon points="-155.328,228.390 -173.886,263.420 -139.217,261.515"/>
<polygon points="-191.784,229.056 -173.886,263.420 -155.328,228.390"/>
<polygon points="-86.521,310.932 -50.000,320.000 -50.000,293.551"/>
<polygon points="-81.140,273.749 -86.521,310.932 -50.000,293.551"/>
<polygon points="-151.828,297.673 -116.382,292.542 -139.217,261.515"/>
<polygon points="-116.382,292.542 -106.084,255.713 -139.217,261.515"/>
<polygon points="-106.084,255.713 -116.382,292.542 -81.140,273.749"/>
<polygon points="-116.382,292.542 -86.521,310.932 -81.140,273.749"/>
<polygon points="-188.265,361.753 -148.687,360.887 -167.705,329.610"/>
<polygon points="-109.914,371.055 -148.687,360.887 -136.087,394.515"/>
<polygon points="-148.687,360.887 -172.139,394.790 -136.087,394.515"/>
<polygon points="-148.687,360.887 -188.265,361.753 -172.139,394.790"/>
<polygon points="-228.291,296.918 -210.050,263.274 -246.545,263.360"/>
<polygon points="-210.050,263.274 -228.526,229.051 -246.545,263.360"/>
<polygon points="-210.050,263.274 -191.784,229.056 -228.526,229.051"/>
<polygon points="-210.050,263.274 -173.886,263.420 -191.784,229.056"/>
<polygon points="-189.924,297.097 -228.291,296.918 -207.813,329.561"/>
<polygon points="-173.886,263.420 -189.924,297.097 -151.828,297.673"/>
<polygon points="-189.924,297.097 -210.050,263.274 -228.291,296.918"/>
<polygon points="-210.050,263.274 -189.924,297.097 -173.886,263.420"/>
<polygon points="-167.705,329.610 -189.924,297.097 -207.813,329.561"/>
<polygon points="-151.828,297.673 -189.924,297.097 -167.705,329.610"/>
<polygon points="-116.382,292.542 -125.317,330.458 -86.521,310.932"/>
<polygon points="-125.317,330.458 -148.687,360.887 -109.914,371.055"/>
<polygon points="-125.317,330.458 -116.382,292.542 -151.828,297.673"/>
<polygon points="-125.317,330.458 -151.828,297.673 -167.705,329.610"/>
<polygon points="-148.687,360.887 -125.317,330.458 -167.705,329.610"/>
<polygon points="-88.394,344.946 -125.317,330.458 -109.914,371.055"/>
<polygon points="-125.317,330.458 -88.394,344.946 -86.521,310.932"/>
<polygon points="-55.246,353.564 -88.394,344.946 -70.615,384.112"/>
<polygon points="-88.394,344.946 -109.914,371.055 -70.615,384.112"/>
<polygon points="-88.394,344.946 -55.246,353.564 -50.000,320.000"/>
<polygon points="-86.521,310.932 -88.394,344.946 -50.000,320.000"/>
</svg>

After

Width:  |  Height:  |  Size: 20 KiB