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
You Might Also Like
Our Free Plans just got better! | Auth0 by Okta
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your secuirty. Auth0 now, thank yourself later.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of MNCubes!