README.md

Java-Median-Cut

Median Cut Algorithm

Implementation of Median Cut Algorithm in java

About The Project

Median cut is an algorithm to sort data of an arbitrary number of dimensions into series of sets by recursively cutting each set of data at the median point along the longest dimension (Wiki).

(back to top)

Prerequisites

The algorithm is completed by Java without any dependence.

(back to top)

Installation

Below is an example of how you can instruct your audience on installing and setting up your app. This template doesn't rely on any external dependencies or services.

1. Clone the repo

   git clone /~https://github.com/yuenci/Java-Median-Cut

2. Open with IntelliJ IDEA

(back to top)

Contributing

If you have a suggestion that would make this better, please fork the repo and create a pull request. You can also simply open an issue with the tag "enhancement". Don't forget to give the project a star! Thanks again!

1. Fork the Project
2. Create your Feature Branch (git checkout -b feature/AmazingFeature)
3. Commit your Changes (git commit -m 'Add some AmazingFeature')
4. Push to the Branch (git push origin feature/AmazingFeature)
5. Open a Pull Request

(back to top)

Authors

Contact

Innis - yuenci1575270674@gmail.com

(back to top)

License

Distributed under the MIT License. See LICENSE for more information.

(back to top)

Acknowledgments

• Extracting a color palette from an image with javascript

• color-palette-extraction