Suppose I have an array of points in random order, and I need to find a polygon (by sorting them, such that every adjacent pair represents a side) which passes through all of the points, and its si...

I have a point cloud of coordinates in numpy. For a high number of points, I want to find out if the points lie in the convex hull of the point cloud. I tried pyhull but I cant figure out how to c...

The qhull library ( qhull.org) has several examples to start in his website, but all the information regarding to the C++ is not very useful to me. I am trying to make a simple convex Hull of 3D p...

Given a set of points S (x, y, z). How to find the convex hull of those points ? I tried understanding the algorithm from here, but could not get much. It says: First project all of the points...

I'm looking for a way to visualize the surface between a number of straight lines, which are defined in a dataframe through their intercepts and slopes. The surface I am looking for is the one that...

I have a set of points. I want to separate them into 2 distinct sets. To do this, I choose two points (a and b) and draw an imaginary line between them. Now I want to have all points that are left ...

I am completing a project in which I have implemented a brute force algorithm for solving the Convex Hull problem. I need to also create a visual for this algorithm. I am trying to create a coordin...

I am making a convex hull using the scipy.spatial package http://docs.scipy.org/doc/scipy/reference/generated/scipy.spatial.ConvexHull.html#scipy.spatial.ConvexHull I've tried searching, but have ...

Given a set of points, points = np.random.randn(...) # n 3d points I would like to uniformly fill the volume defined by the convex hull in which they lie by a list (np.array of shape nx3) of 3d...

I have a program that calculates the convex hull of an image. I'm trying to use this information in order to count the number of fingers that are present in an input image. From some surfing I foun...

The value of the "area" attribute in scipy ConvexHull (see http://docs.scipy.org/doc/scipy/reference/generated/scipy.spatial.ConvexHull.html) object does not seem to be (what I understand to be) th...

I have a list of line segments in no particular order. I want to find all enclosed spaces (polygons) formed by the segments. Is there an efficient algorithm or method that I could use to do this? ...

I'm trying to calculate and show a convex hull for some random points in python. This is my current code: import numpy as np import random import matplotlib.pyplot as plt import cv2 points = np....

Setup Given some set of nodes within a convex hull, assume the domain contains one or more concave areas: where blue dots are points, and the black line illustrates the domain. Assume the point...

Standard convex hull algorithms will not work with (longitude, latitude)-points, because standard algorithms assume you want the hull of a set of Cartesian points. Latitude-longitude points are not...

I want to find XY of the center (red) of a convex-hull points (orange circles) set that is a result from collision detection. Using separating-axis technique, I know for sure that the convex sha...

Is there an "alpha shape" function in 3 dimensions in python, other than the CGAL python bindings? Alternatively, is there a way to extend the example below into 3D? 2D example: draw a smooth po...

I would like an algorithm to calculate the convex hull of 4 2D points. I have looked at the algorithms for the generalized problem, but I wonder if there is a simple solution for 4 points.

I'm trying to implement the Graham’s Scan algorithm for a convex hull in Java, and have trouble sorting the points by polar angle with respect to the point with lowest y-value. I have found this ...

Is there a fast way to do this? Searching online shows convexity of functions or single polygons. But I need the ability to check this for the whole model. An object can have convex faces but can b...

Please help me, I have a problem for Convex Hull on Android. I use Java and OpenCV 2.3. Before I made it on Java, I made it on C++ with Visual Studio 2008. This code can running successfully on...

How to compute the convex hull starting from collection of points? I am looking for an implementation of Convex hull algorithm in C#

I have a set of points A. I get the convex hull CH_A of A. Then, I have extra points, point set B. I add B into A and get a bigger point set. I obtain the convex hull CH_AB of this bigger set cont...

I'm trying to add a hull around the D3 network graph that I've build. My network is based on this JSFiddle (can't share mine because of sensitive data) and basically the end product should be a net...

I have a convex set in a Euclidean space (3D, but would like answers for nD) that is characterized by a finite set of half-spaces (normal vector + point). Is there a better algorithm to find the e...