Lp_solve is freely available (under LGPL 2) software for solving
linear, integer and mixed integer programs. In this implementation
we supply a "wrapper" function in C and some R functions that solve
general linear/integer problems, assignment problems, and transportation
problems. This version calls lp_solve version 5.5.
WWW: https://cran.r-project.org/web/packages/lpSolve/
A fast C++ implementation to generate contour lines (isolines) and
contour polygons (isobands) from regularly spaced grids containing
elevation data.
WWW: https://cran.r-project.org/web/packages/isoband/
Reading, writing, manipulating, analyzing and modeling of gridded
spatial data. The package implements basic and high-level functions.
Processing of very large files is supported. There is a also support
for vector data operations such as intersections.
WWW: https://cran.r-project.org/web/packages/raster/
- gp2c: Package for translating GP routines into C
- pari_elldata: Elliptic Curve Data for PARI/GP
- pari_galdata: Data needed by PARI/GP for polgalois
- pari_galpol: Database of Galois polynomials for PARI/GP
- pari_nftables: Repackaging of the historical megrez number field tables
- pari_seadata: Modular polynomials for PARI/GP
Library (FCL), an excellent C++ library for performing proximity and
collision queries on pairs of geometric models. Currently, this package
is targeted for FCL 0.5.0.
WWW: https://libraries.io/pypi/python-fcl
python-fcl otherwise please use the fcl port.
N.B. python-fcl also needs octomap
FCL is a library for performing three types of proximity queries on a pair of
geometric models composed of triangles.
It performs:
* Collision detection: detecting whether the two models overlap, and optionally,
all of the triangles that overlap.
* Distance computation: computing the minimum distance between a pair of models,
i.e., the distance between the closest pair of points.
* Tolerance verification: determining whether two models are closer or farther
than a tolerance distance.
* Continuous collision detection: detecting whether the two moving models
overlap during the movement, and optionally, the time of contact.
* Contact information: for collision detection and continuous collision
detection, the contact information (including contact normals and contact
points) can be returned optionally.
quality mesh generator and delaunay triangulator library.
This implementation utilizes Cython_ to wrap the C API as closely as possible.
WWW: https://rufat.be/triangle
Claripy is an abstracted constraint-solving wrapper for Python.
It is being developed by the Angr project.
WWW: https://github.com/angr/claripy
PR: 244562
pySMT is a library for SMT formulae manipulation and solving, which makes
working with Satisfiability Modulo Theory simple.
Among others, the user can:
- Define formulae in a solver independent way in a simple and inutitive
way,
- Write ad-hoc simplifiers and operators,
- Dump your problems in the SMT-Lib format,
- Solve them using one of the native solvers, or by wrapping any SMT-Lib
complaint solver.
pySMT provides methods to define a formula in Linear Real Arithmetic (LRA),
Real Difference Logic (RDL), their combination (LIRA), Equalities and
Uninterpreted Functions (EUF), Bit-Vectors (BV), and Arrays (A). The
following solvers are supported through native APIs: MathSAT, Z3, CVC4,
Yices, CUDD, PicoSAT, and Boolector. Additionally, you can use any SMT-LIB
2 compliant solver.
PySMT assumes that the python bindings for the SMT Solver are installed and
accessible from your PYTHONPATH.
WWW: http://www.pysmt.org
PR: 244562
Yuri Victorovich
Sunpoet Po-Chuan Hsieh
Thierry Thomas
TAKATSU Tomonari
Tobias Kortkamp
Antoine Brodin
Diane Bruce
Mateusz Piotrowski
Rene Ladan