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
Find Hidden Risks in Windows Task Scheduler
Windows Task Scheduler might be hiding critical failures. Download the free JAMS diagnostic tool to uncover problems before they impact production—get a color-coded risk report with clear remediation steps in minutes.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of MNCubes!