https://github.com/mit-acl/separator
Linear separability (via planes) of two sets of 3D points
https://github.com/mit-acl/separator
3d-points convex-hull feasibility glpk linear-programming linear-separability planes polyhedra
Last synced: 3 months ago
JSON representation
Linear separability (via planes) of two sets of 3D points
- Host: GitHub
- URL: https://github.com/mit-acl/separator
- Owner: mit-acl
- License: bsd-3-clause
- Created: 2020-08-10T17:22:38.000Z (over 5 years ago)
- Default Branch: master
- Last Pushed: 2022-01-21T20:41:40.000Z (about 4 years ago)
- Last Synced: 2024-04-20T20:55:21.962Z (almost 2 years ago)
- Topics: 3d-points, convex-hull, feasibility, glpk, linear-programming, linear-separability, planes, polyhedra
- Language: C++
- Homepage:
- Size: 2.44 MB
- Stars: 12
- Watchers: 3
- Forks: 3
- Open Issues: 0