Tag: Convex

Computing Convex Hulls

Imagine that you have a bunch of points in the 2-dimensional plane. Image by the author. A convex hull is a simple geometric shape that represents or summarizes such point clouds. Speaking in mathematic language, it is the smallest convex subset that contains all the given points...

A gentle introduction to the convex hull problem

Convex hulls tend to be useful in many different fields, sometimes quite unexpectedly. In this article, I’ll explain the basic Idea of 2d convex hulls and how to use the graham scan to find them. So if you already know about the graham scan, then this article is not for you, but if not, this s...

Convex Hulls for the Traveling Salesman Problem

this method only works directly in the case of the Euclidean TSP. This is a special class of TSP problems where the distance between two cities is given by the Euclidean distance, also known as the L2 norm. However, there are also ways to extend it to non-Euclidean instances as shown by th...

The Convex Hull Problem

This problem could be interesting on its own, but as it turns out the convex hull has many usages. For example, in Math — Gauss–Lucas theorem states that the roots of a polynomial’s derivative all lie within the convex hull of the roots of the polynomial (experimenting with this...

A Search for Better Convex Decomposition

Roblox introduced Constructive Solid Geometry back in 2014, and supporting the physics simulation of this project was my first large project on the simulation team along with Tim Loduha. Back then the company was much smaller, and the Physics team only had two people who had other non-developme...