diskpack 0.10.2__tar.gz → 0.10.3__tar.gz

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -1,6 +1,6 @@
1
1
  Metadata-Version: 2.4
2
2
  Name: diskpack
3
- Version: 0.10.2
3
+ Version: 0.10.3
4
4
  Summary: A high-performance vectorized circle packer with spatial hashing.
5
5
  Author-email: James Kelly <mrkellyjam@gmail.com>
6
6
  Requires-Python: >=3.8
@@ -13,7 +13,7 @@ Dynamic: license-file
13
13
 
14
14
  State-of-the-art circle packing for arbitrary polygons.
15
15
 
16
- ![packed star](star\_packed.png)
16
+ ![packed star](https://raw.githubusercontent.com/semajyllek/diskpack/main/star_packed.png)
17
17
 
18
18
 
19
19
 
@@ -191,7 +191,7 @@ Fixed radius (r=3.0) on Star shape:
191
191
 
192
192
  diskpack achieves higher density and faster packing compared to the Python Shapely library. Where Shapely creates Python objects for each point-in-polygon and distance check, diskpack uses vectorized NumPy operations with precomputed edge geometry and batched candidate evaluation — sampling many points per iteration and greedily placing the largest valid circle. A grid-based spatial index keeps collision detection O(1) as circle count grows. The batched Shapely method can approach similar density by also picking the best of many candidates, but at ~30x the runtime due to per-point object overhead.
193
193
 
194
- ![diskpack vs shapely comparison](diskpack_shapely_comp.png)
194
+ ![diskpack vs shapely comparison](https://raw.githubusercontent.com/semajyllek/diskpack/main/diskpack_shapely_comp.png)
195
195
 
196
196
  | Method | Circles | Density | Time |
197
197
  |--------|---------|---------|------|
@@ -2,7 +2,7 @@
2
2
 
3
3
  State-of-the-art circle packing for arbitrary polygons.
4
4
 
5
- ![packed star](star\_packed.png)
5
+ ![packed star](https://raw.githubusercontent.com/semajyllek/diskpack/main/star_packed.png)
6
6
 
7
7
 
8
8
 
@@ -180,7 +180,7 @@ Fixed radius (r=3.0) on Star shape:
180
180
 
181
181
  diskpack achieves higher density and faster packing compared to the Python Shapely library. Where Shapely creates Python objects for each point-in-polygon and distance check, diskpack uses vectorized NumPy operations with precomputed edge geometry and batched candidate evaluation — sampling many points per iteration and greedily placing the largest valid circle. A grid-based spatial index keeps collision detection O(1) as circle count grows. The batched Shapely method can approach similar density by also picking the best of many candidates, but at ~30x the runtime due to per-point object overhead.
182
182
 
183
- ![diskpack vs shapely comparison](diskpack_shapely_comp.png)
183
+ ![diskpack vs shapely comparison](https://raw.githubusercontent.com/semajyllek/diskpack/main/diskpack_shapely_comp.png)
184
184
 
185
185
  | Method | Circles | Density | Time |
186
186
  |--------|---------|---------|------|
@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
4
4
 
5
5
  [project]
6
6
  name = "diskpack"
7
- version = "0.10.2"
7
+ version = "0.10.3"
8
8
  authors = [{ name="James Kelly", email="mrkellyjam@gmail.com" }]
9
9
  description = "A high-performance vectorized circle packer with spatial hashing."
10
10
  readme = "README.md"
@@ -1,6 +1,6 @@
1
1
  Metadata-Version: 2.4
2
2
  Name: diskpack
3
- Version: 0.10.2
3
+ Version: 0.10.3
4
4
  Summary: A high-performance vectorized circle packer with spatial hashing.
5
5
  Author-email: James Kelly <mrkellyjam@gmail.com>
6
6
  Requires-Python: >=3.8
@@ -13,7 +13,7 @@ Dynamic: license-file
13
13
 
14
14
  State-of-the-art circle packing for arbitrary polygons.
15
15
 
16
- ![packed star](star\_packed.png)
16
+ ![packed star](https://raw.githubusercontent.com/semajyllek/diskpack/main/star_packed.png)
17
17
 
18
18
 
19
19
 
@@ -191,7 +191,7 @@ Fixed radius (r=3.0) on Star shape:
191
191
 
192
192
  diskpack achieves higher density and faster packing compared to the Python Shapely library. Where Shapely creates Python objects for each point-in-polygon and distance check, diskpack uses vectorized NumPy operations with precomputed edge geometry and batched candidate evaluation — sampling many points per iteration and greedily placing the largest valid circle. A grid-based spatial index keeps collision detection O(1) as circle count grows. The batched Shapely method can approach similar density by also picking the best of many candidates, but at ~30x the runtime due to per-point object overhead.
193
193
 
194
- ![diskpack vs shapely comparison](diskpack_shapely_comp.png)
194
+ ![diskpack vs shapely comparison](https://raw.githubusercontent.com/semajyllek/diskpack/main/diskpack_shapely_comp.png)
195
195
 
196
196
  | Method | Circles | Density | Time |
197
197
  |--------|---------|---------|------|
File without changes
File without changes
File without changes