-
Notifications
You must be signed in to change notification settings - Fork 5
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
6 changed files
with
229 additions
and
31 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,3 +1,43 @@ | ||
# Jagua-rs ![workflow](https://github.com/JeroenGar/jagua-rs/actions/workflows/rust.yml/badge.svg) | ||
**An open-source collision detection engine for 2D irregular cutting and packing problems writen in Rust 🦀.** | ||
|
||
🚧 Under construction 🚧 | ||
<img src="assets/jaguars_logo.svg" width="50%" alt="Jaguars logo"> | ||
|
||
# 🚧 Under construction 🚧 | ||
|
||
## Introduction | ||
2D irregular cutting and packing (C&P) problems are a class of optimization problems that involve placing irregular shaped items into containers in an efficient way. | ||
These problems typically contain two challenges: | ||
* **Combinatorial** challenge: deciding which items to place where to minimize some objective function. | ||
* **Geometric** challenge: can we place an item at a certain position without colliding with other items? (feasibility check) | ||
|
||
`Jagua-rs` aims to decouple these two challenges by developing a Collision Detection Engine (CDE) that can be used to efficiently deal with the geometric challenges at hand. | ||
|
||
|
||
## Contents | ||
|
||
### Jaguars | ||
The `jaguars` crate all required logic for modeling 2D irregular cutting and packing problems in addition to the CDE. | ||
|
||
**See [jaguars](jaguars) for more information.** | ||
|
||
## LBF | ||
In addition, a reference implementation of an optimization algorithm which uses the CDE is also provided. \ | ||
`lbf` is a simple left-bottom-fill heuristic, which places the items one-by-one in the bin each time at the left-bottom most position. | ||
It should provide a good starting point for anyone looking to create a more advanced optimization algorithm using ``jaguars``. | ||
|
||
**See [lbf](lbf) for more information.** | ||
|
||
## Assets | ||
|
||
TODO | ||
|
||
## Acknowledgements | ||
|
||
This project was funded by [Research Foundation - Flanders (FWO)](https://www.fwo.be/en/) (grant number: 1S71222N) | ||
|
||
<img src="https://upload.wikimedia.org/wikipedia/commons/f/fc/Fonds_Wetenschappelijk_Onderzoek_logo.svg" width="10%" alt="FWO logo"> | ||
|
||
## License | ||
|
||
This project is licensed under the Mozilla Public License 2.0 - see the [LICENSE](LICENSE) file for details. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.