Python script to determine a least covering path in a uniform 2D/3D rectangular point grid. The algorithm is WIP and does not work yet. A least covering path is defined as a path made out of the least number of continuously connected line segments that cover all the points that compose the grid.
-
Notifications
You must be signed in to change notification settings - Fork 0
WIP: Python script to determine a least covering path in a uniform 2D/3D rectangular point grid.
License
serraedoardo/3D_Least_covering_path
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
WIP: Python script to determine a least covering path in a uniform 2D/3D rectangular point grid.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published