A 2D line can be rasterized into a 8-connected sequence of pixels which exhibit repeating patterns of connected pixels.
Likewise, a 3D plane can be rasterized into connected cubes. A 'rectangular' cut of m x n cubes is a (m,n)-cube.
Given m and n, the goal of this project is to generate all the (m,n)-cubes for all the (integer) discrete planes, based on the intersection vertices on a Farey diagram.
Categories
Scientific/EngineeringLicense
MIT LicenseFollow MNCubes
Other Useful Business Software
99.99% Uptime for MySQL and PostgreSQL Databases
Cloud SQL Enterprise Plus delivers near-zero downtime with 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of MNCubes!