Convex

Ouellet Convex Hull is currently the only ‘Online’ Convex Hull in O(log h) per point, where 'Online' stands for dynamically add one point at a time. Based on our own test against many other algorithm implementations, including Chan and Voronoi/Delaunay, it appears to be the fastest one.

Is there any algorithm (or better C# subroutine) to decrease an existing 2D convex hull on the desired percent (for example, to obtain a 90% central area of the known convex hull)? Thank you for your help! What I have tried: I can create points of a 100% convex hull, but it is necessary to...

Hi! I'm doing a project on Python and I need to calculate the concave envelope of a function f but I don't know where to start! It's my first project on Python. I'm reading a lot of stuff on Concave Hull and this is why I wanted to use the relation between "concave hulls of a set - epigraph of...

Quote: How do I calculate the concave envelope of a function (on Python)? We can't really help you in any way because you forgot to tell us your background in programming. Quote: It's my first project on Python. Which word matters? A first project in Python is not a big deal to a seasoned...

An algorithm to determine if a point is inside a 3D convex polygon for a given polygon vertices in C++