k-means Clustering
A Processing visualization of the k-means clustering algorithm, demonstrating iterative centroid-based data partitioning and Voronoi cell formation for different values of k.
Category Archive
Java
Entries connected to "Java", gathered in one place for quick browsing.
Entries
29
Categories
25
Tags
203
Collection filter
Refine this page
Narrow the entries already loaded here by title, summary, category, or tag.
Blending Textures With Open Simplex Noise
A Processing implementation that combines Open Simplex Noise with image blending techniques to create smooth, organic animations of texture transitions.
Cube Wave
A Processing implementation of a 3D cube wave animation using PeasyCam for camera control, featuring dynamic lighting and orthographic projection for a mesmerizing visual effect.
Lorenz Doll
A Processing visualization where each pixel of an image is transformed into a Lorenz System, with the system’s velocity mapped to the original pixel’s brightness values.
Barnsley Fern
A Processing implementation of the Barnsley Fern fractal, demonstrating iterative geometric transformations to create a self-similar fern-like pattern with applications in computer graphics and chaos theory.
UVa Online Judge Challenge "11045"
This is a maximum flow problem on a bipartite graph. I created the flow chart above to visualize the 3 test cases. The virtual judge run time was 0.18s.
Kattis Challenge "Grid"
Solved using a non-recursive version of BFS. Runs in pretty good time.
UVa Online Judge Challenge "10305"
This problem presents a DAG and the solution requires implementing a topological sort. I noticed that a topological sort can be implemented using only boolean arrays so I used this as an opportunity to finally get around to using Java’s BitSet class. The virtual judge run time was 0.050s.
UVa Online Judge Challenge "572"
Although BFS and DFS were recommended solutions to the problem, I saw an opportunity to solve this problem using Disjoint Sets. The virtual judge run time was 0.050s.
Comparing Java Distance Functions
A Java program that compares various distance calculation methods, including Manhattan, Euclidean, and Chebyshev distances, and visualizes their differences using Processing.
Kruskal's Algorithm Visualized With Processing
A Processing implementation of Kruskal’s algorithm for finding minimum spanning trees in weighted graphs, demonstrating the O(E log E) greedy approach to network optimization.
Faster Java String Inputs
A high-performance Java input reader class optimized for programming contests, providing fast integer and double parsing with automatic tokenization and buffering options.
Recently Created
Latest entries created
The 10 most recently created entries, sorted by each entry's publish date.
Recently Updated
Latest revisions across entries
The 10 most recently updated entries, sorted by each entry's last modification date.
Relationship Map
Memory Field
Use the relationship map to follow related categories, tags, and entries beyond the current list.