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.

Project Samples

Project Activity

See All Activity >

License

MIT License

Follow MNCubes

MNCubes Web Site

Other Useful Business Software
Build Data Resilience - Take the Assessment Today Icon
Build Data Resilience - Take the Assessment Today

Can you recover when it matters most? Take this quick assessment to identify gaps and build greater recovery confidence.

Is your recovery strategy as strong as you think? Take this quick self-assessment to check your recovery readiness and gain tailored insights. In only 2 minutes, you'll learn where you fall on the recovery readiness scale.
Take the Assessment
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of MNCubes!

Additional Project Details

User Interface

Java Swing

Programming Language

Java

Related Categories

Java Scientific Engineering

Registered

2012-12-02