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
Outgrown Windows Task Scheduler? Icon
Outgrown Windows Task Scheduler?

Free diagnostic identifies where your workflow is breaking down—with instant analysis of your scheduling environment.

Windows Task Scheduler wasn't built for complex, cross-platform automation. Get a free diagnostic that shows exactly where things are failing and provides remediation recommendations. Interactive HTML report delivered in minutes.
Download Free Tool
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