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

You Might Also Like
Deliver secure remote access with OpenVPN. Icon
Deliver secure remote access with OpenVPN.

Trusted by nearly 20,000 customers worldwide, and all major cloud providers.

OpenVPN's products provide scalable, secure remote access — giving complete freedom to your employees to work outside the office while securely accessing SaaS, the internet, and company resources.
Get started — no credit card required.
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