how can I calculate the centroid of a convex hull using python and scipy? All I found are methods for computing Area and Volume. regards,frank.

I want to know an approximate 3D position and 3D normal of collision site between two 3D convex hulls (A vs B). The CPU in parenthesis shows relative CPU-time needed in my finished program. Part...

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'm misunderstanding the idea behind the minima in the derivation of the logistic regression formula. The idea is to increase the hypothesis as much as possible (i.e correct prediction probability...

I'm trying to solve the problem d = 0.5 * ||X - \Sigma||_{Frobenius Norm} + 0.01 * ||XX||_{1}, where X is a symmetric positive definite matrix, and all the diagnoal element should be 1. XX is s...

Suppose there are a number of convex polygons on a plane, perhaps a map. These polygons can bump up against each other and share an edge, but cannot overlap. To test if two polygons P and Q over...

Ok, so I have a polygon (simple but concave) that I'm trying to cut into triangles to make it collide with an other polygon. I knew my polygone was concave, so i decided to use LibGDX EarClippingT...

I've got a 3D solid, represented as the union of a set of polyhedral convex hulls. (Or a single convex, if that makes things easier.) I'd like to approximate that solid as the union of a set of sph...

I'm looking for an efficient algorithm that determines if a polyhedron is convex. I started by checking that the Euler characteristic is 2. And I'm also checking that every face is convex. But tha...

I'm looking for an algorithm for finding largest subset of points (by largest i mean in number) that form a convex polygon from the given set of point. I think this might be solvable using DP but i...

I have a programming formulation from a paper and want to give it a tool for solving specific problems. The authors stated it as an linear programming (LP) instance, however I am not sure. Formulat...

I am trying to solve quite a difficult problem for me. I'm not new to programming, but I don't really know how to figure out this problem. It's given a set of points (point []) with Xi and Yi coord...

My question is very similar to Plow's Question; but with this difference: How can I find the maximum convex area that can fit inside a non-convex region? For an example, consider this non-convex...

Given a three dimensional triangle mesh, how can I find out whether it is convex or concave? Is there an algorithm to check that? If so it would be useful to define a tolerance range to ignore smal...

Perhaps this is more of a math question than a programming question, but I've been trying to implement the rotating calipers algorithm in XNA. I've deduced a convex hull from my point set using a ...

I am looking for a C++ library, and I am dealing with convex objective and constraint functions.