Download JAR files tagged by constructive with all dependencies
jcsg from group eu.mihosoft.vrl.jcsg (version 0.5.7)
Java implementation of BSP based CSG (Constructive Solid Geometry)
11 downloads
Artifact jcsg
Group eu.mihosoft.vrl.jcsg
Version 0.5.7
Last update 07. April 2018
Organization not specified
URL https://github.com/miho/JCSG/wiki
License BSD 2-Clause
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group eu.mihosoft.vrl.jcsg
Version 0.5.7
Last update 07. April 2018
Organization not specified
URL https://github.com/miho/JCSG/wiki
License BSD 2-Clause
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
interactive-bin-packing from group org.cicirello (version 3.1.5)
Group: org.cicirello Artifact: interactive-bin-packing
Show all versions Show documentation Show source
Show all versions Show documentation Show source
0 downloads
straightedge from group com.massisframework (version 0.8)
Includes 2 main parts:
- Path finding through 2D polygons using the A star algorithm and navigation-mesh generation
Field of vision / shadows / line of sight / lighting.
The basic polygon and point classes are the KPolygon and KPoint.
KPolygon contains a list of KPoints for vertices as well as a center (centroid), area, and radius (circular bound or distance from center to furthest point).
KPolygon was born out of the need for a more game-oriented and flexible polygon class than the Path2D class in the standard Java library. KPolygon implements java.awt.geom.Shape so it can be easily drawn and filled by Java2D's Graphics2D object.
- This API provides path-finding and field-of-vision. For other complex geometric operations such as buffering (fattening and shrinking) and constructive area geometry (intersections and unions) it is recommended to use the excellent Java Topology Suite (JTS). The standard Java2D library also provides the Area class which can be used for some constructive area geometry operations. Note that there is a utility class PolygonConverter that can quickly convert KPolygons to JTS polygons and vice versa.
Artifact straightedge
Group com.massisframework
Version 0.8
Last update 21. December 2015
Organization not specified
URL https://github.com/rpax/straightedge
License New BSD License
Dependencies amount 1
Dependencies jts,
There are maybe transitive dependencies!
Group com.massisframework
Version 0.8
Last update 21. December 2015
Organization not specified
URL https://github.com/rpax/straightedge
License New BSD License
Dependencies amount 1
Dependencies jts,
There are maybe transitive dependencies!
chips-n-salsa from group org.cicirello (version 7.0.1)
Chips-n-Salsa is a Java library of customizable,
hybridizable, iterative, parallel, stochastic, and self-adaptive
local search algorithms. The library includes implementations of
several stochastic local search algorithms, including simulated
annealing, hill climbers, as well as constructive search algorithms
such as stochastic sampling. Chips-n-Salsa now also includes genetic
algorithms as well as evolutionary algorithms more generally. The
library very extensively supports simulated annealing. It includes
several classes for representing solutions to a variety of optimization
problems. For example, the library includes a BitVector class that
implements vectors of bits, as well as classes for representing
solutions to problems where we are searching for an optimal vector
of integers or reals. For each of the built-in representations, the
library provides the most common mutation operators for generating
random neighbors of candidate solutions, as well as common crossover
operators for use with evolutionary algorithms. Additionally, the
library provides extensive support for permutation optimization
problems, including implementations of many different mutation
operators for permutations, and utilizing the efficiently implemented
Permutation class of the JavaPermutationTools (JPT) library.
Chips-n-Salsa is customizable, making extensive use of Java's generic
types, enabling using the library to optimize other types of representations
beyond what is provided in the library. It is hybridizable, providing
support for integrating multiple forms of local search (e.g., using a hill
climber on a solution generated by simulated annealing), creating hybrid
mutation operators (e.g., local search using multiple mutation operators),
as well as support for running more than one type of search for the same
problem concurrently using multiple threads as a form of algorithm portfolio.
Chips-n-Salsa is iterative, with support for multistart metaheuristics,
including implementations of several restart schedules for varying the run
lengths across the restarts. It also supports parallel execution of multiple
instances of the same, or different, stochastic local search algorithms for
an instance of a problem to accelerate the search process. The library
supports self-adaptive search in a variety of ways, such as including
implementations of adaptive annealing schedules for simulated annealing,
such as the Modified Lam schedule, implementations of the simpler annealing
schedules but which self-tune the initial temperature and other parameters,
and restart schedules that adapt to run length.
0 downloads
Artifact chips-n-salsa
Group org.cicirello
Version 7.0.1
Last update 12. December 2024
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 3
Dependencies jpt, rho-mu, core,
There are maybe transitive dependencies!
Group org.cicirello
Version 7.0.1
Last update 12. December 2024
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 3
Dependencies jpt, rho-mu, core,
There are maybe transitive dependencies!
Page 1 from 1 (items total 4)
© 2015 - 2024 Weber Informatics LLC | Privacy Policy