Zahoor·Oct 30, 2025The Geometry Behind Efficiency: Exploring the Science Behind Convex Hull AlgorithmsBefore exploring the algorithms, let’s revise some important concepts related to geometry and answer few important questions.
Dat Sword·Jul 9, 2025For a convex shape a perfect centerThe Collision Detection algorithm known as Minowski Portal Refinement (MPR), also known as XenoCollide, the center of the Convex shape must…
Uri Itai·Jun 10, 2025Convex Hull-Based Anomaly Detection: Bridging Interpretability and PerformanceWhen Geometry Beats the Black Box: A Fresh Take on Anomaly Detection
Murat Yücel·Jun 6, 2024Merak Serisi 2: Konveks Kapanma (Convex Hull) Örneği — Nokta Dizisinden Oluşabilecek En Yüksek…Matematik ve algoritmalarla ilgili merak ettiğim konuları ve ihtiyaçları bu seride kendime not olarak ekleyeceğim. “Merak Serisi” nin bu…
Akhil Chhibber·Dec 13, 2023Bounding Geospatial Data: Different Approaches and MethodsIn this Blog, we’ll explore a variety of techniques for defining boundaries around a set of geospatial points, lines, or polygons. Bounding…
InAll About AlgorithmsbyDr. Robert Kübler·Nov 18, 2023Computing Convex HullsAka how to wrap a bunch of pointsA response icon2A response icon2
Kedarfitwe·Nov 14, 2023Implementing Convex Hull in PythonA convex hull is the smallest convex set that contains a given set of points in a Euclidean space. In simpler terms, imagine you have a set…
Mika Tal·Aug 5, 2023The Convex Hull ProblemFinding the smallest convex polygon enclosing a set of points. Python code included.
