Problem It looks like this is a really classical question, but I’d like to ask it one more time as […]
Tag: computational-geometry
Generate points for smooth movement between two given points
Problem This is one of the methods in a project for generating points between two given points. We add points […]
Union Polygon Algorithm
Problem This is my attempt at creating a Union Algorithm for an arbitrary set of any number of arbitrary simple […]
Finding the closest pair of points divide-and-conquer
Problem Here is my code for the famous “finding the closest pair of points” problem from CLRS book section 33.4 […]
Artifact collision in plane module
Problem Here’s something I tried putting together as I’m learning. Critiques on anything are welcome. There’s also a logic bug […]
Find intersection of rectangle with itself rotated
Problem Given ww, height αα around origin clockwise, I wrote a code to find the intersection area. First I find […]
Union Polygon Algorithm
Problem This is my attempt at creating a Union Algorithm for an arbitrary set of any number of arbitrary simple […]
Detecting two intersecting circles with editable x, y, and radius in JavaFX
Problem I was actually pretty proud of this programming project that I came across in this book I’m working through. […]
Isometric Projection and Culling
Problem I’m working on a small isometric drawing system in JavaScript. After much help from the Gamedev section, reading old […]
Finding the closest pair of points divide-and-conquer speed improvement
Problem This is a follow up to a previously asked Finding the closest pair of points divide-and-conquer question . The […]