rectpack | Python 2D rectangle packing library | Computer Vision library

by secnot Python Version: 0.2.2 License: Apache-2.0

X-Ray Key Features Code Snippets Community Discussions(1)Vulnerabilities Install Support

kandi X-RAY | rectpack Summary

rectpack is a Python library typically used in Artificial Intelligence, Computer Vision, Example Codes applications. rectpack has no bugs, it has no vulnerabilities, it has build file available, it has a Permissive License and it has low support. You can install using 'pip install rectpack' or download it from GitHub, PyPI.

Rectpack is a collection of heuristic algorithms for solving the 2D knapsack problem, also known as the bin packing problem. In essence packing a set of rectangles into the smallest number of bins.

Support

Quality

Security

License

Reuse

Support

rectpack has a low active ecosystem.

It has 339 star(s) with 83 fork(s). There are 20 watchers for this library.

It had no major release in the last 12 months.

There are 27 open issues and 15 have been closed. On average issues are closed in 35 days. There are 1 open pull requests and 0 closed requests.

It has a neutral sentiment in the developer community.

The latest version of rectpack is 0.2.2

Quality

rectpack has 0 bugs and 0 code smells.

Security

rectpack has no vulnerabilities reported, and its dependent libraries have no vulnerabilities reported.

rectpack code analysis shows 0 unresolved vulnerabilities.

There are 0 security hotspots that need review.

License

rectpack is licensed under the Apache-2.0 License. This license is Permissive.

Permissive licenses have the least restrictions, and you can use them in most projects.

Reuse

rectpack releases are not available. You will need to build from source code and install.

Deployable package is available in PyPI.

Build file is available. You can build the component from source.

Installation instructions, examples and code snippets are available.

rectpack saves you 1528 person hours of effort in developing the same functionality from scratch.

It has 3405 lines of code, 329 functions and 22 files.

It has low code complexity. Code complexity directly impacts maintainability of the code.

Top functions reviewed by kandi - BETA

kandi has reviewed rectpack and discovered the below as its top functions. This is intended to give you an instant insight into rectpack implemented functionality, and help decide if they suit your requirements.

Pack the rectangles
Create a new empty bin
Find the best fit for a given pbin
Add a rectangle to the bin
Add a rectangle
Remove duplicates from max_rects
Returns True if this rectangle contains the given rectangle
Select a rectangle based on the current position
Adds a rectangle to the figure
Calculate the fitness for a section
Splits the given section
Return the best matching section
Return the area of the meshes
Area of the rectangle
Ensure that rectangles are inside the surface
Splits a section
Return the fitness for a section
Reset the pool

Get all kandi verified functions for this library.

rectpack Key Features

No Key Features are available at this moment for rectpack.

rectpack Examples and Code Snippets

No Code Snippets are available at this moment for rectpack.

Community Discussions

Trending Discussions on rectpack

1D multiple sized bin packing algorithm with least waste

QUESTION

1D multiple sized bin packing algorithm with least waste

Asked 2020-Dec-10 at 06:56

I am trying to apply a 1D bin packing with unlimited number of bins.

...

ANSWER

Answered 2020-Dec-10 at 06:56

I managed to create my own logic for this question. As you can see, I have put many comments in my code that will help you understand different segments of the code.

Source https://stackoverflow.com/questions/63561558

Community Discussions, Code Snippets contain sources that include Stack Exchange Network

Vulnerabilities

No vulnerabilities reported

Install rectpack

Download the package or clone the repository, and then install with:.

Support

This library implements three of the algorithms described in [1] Skyline, Maxrects, and Guillotine, with the following variants:. I recommend to use the default algorithm unless the packing is too slow, in that case switch to one of the Guillotine variants for example GuillotineBssfSas. You can learn more about the algorithms in [1].

Find more information at: