Questions tagged [convex]

Anything related to convex geometric shapes. A shape in an Euclidean space is convex if, given two points A and B, every point of the segment AB belongs to the shape, i.e. AB is a subset of the shape.

Anything related to convex geometric shapes.

A shape in an Euclidean space is convex if, given two points A and B, every point of the segment AB belongs to the shape, i.e. AB is a subset of the shape.

See Wikipedia on:

139 questions
1
vote
1 answer

Mathematica convex optimization

I am trying to solve some problems that can be mapped in convex optimisation problem. In particular is for analysis of quantum state tomography data. In Matlab there are some tools to help you do this, like SeDuMi or CVX…
Raf
  • 323
  • 2
  • 7
1
vote
1 answer

Finding indexes of convex points on a contour

I have a vector of ordered Points that make up the contour of a worm (found with opencv). I am trying to get points along the skeleton of the worm. I want to do this very fast and so have a simple segmentation function: void…
1
vote
2 answers

Splitting box into convex solids around an inscribed solid (i.e. "carving out")

I am given a right rectangular prism (i.e. a box) and an arbitrary convex solid within it, such that the box matches the AABB (axis-aligned bounding box) of the aforementioned solid. I would like to "carve out" the solid from the box and, in doing…
Konstantin
  • 2,885
  • 3
  • 22
  • 23
1
vote
0 answers

Rectangular Convex Decomposition of Arbitrary 3D Grid of Points

I have a 3D grid of binary data values (either the point is solid or it's not). I need to generate a physics mesh from that grid, but it needs to be able to move, so I can't use triangle mesh, I must use a compound shape made of boxes. I need to…
Clonkex
  • 3,373
  • 7
  • 38
  • 55
1
vote
1 answer

C++ implementation of quickhull with general precision for arbitrary dimension

Is there any C++ (Java, or similar easy translatable to C++) implementation of n-dimension quickhull algorithm for general precision numbers? I am aware of the existence of the qhull implementation (is arbitrary dimension, is C/C++, but not general…
Tomilov Anatoliy
  • 15,657
  • 10
  • 64
  • 169
1
vote
1 answer

Get convex polygons from vertex

Im writing a game in XNA and Im working right now in the pathfinding of the AI. In my map there are some circular obstacles and I would like to use the mesh navigation technique (http://udn.epicgames.com/Three/NavigationMeshReference.html) so…
Chemari
  • 43
  • 7
1
vote
1 answer

extra point in convex hull (using graham scan) error + java

my code which is using graham algorithm to find the convex hull works pretty well (it shows me the polygon it suppose to show) but I can see that it sends me one extra collinear point (though I'm handling the collinear point in my code) here is my…
Navid Koochooloo
  • 285
  • 1
  • 5
  • 20
1
vote
1 answer

Choosing points for a 2d Convex Hull

I am making one algorithm a day, and didn't make to finish this one recently. I have a set of points that i draw, and now I'd like to chose pairs to draw lines between them so that when it's done they will form a convex hull. My idea was to start…
user1577191
  • 103
  • 7
1
vote
1 answer

Convert counter clockwise polygon to a clockwise one

If I have the following array structure of polygon vertices (polygons can be both convex and concave): [ [x = 5, y = 5], [x = 10, y = 10], [x = 3, y = 15], [x = 0, y = 7] ] I can easily tell if the polygon is clockwise or counter clockwise. But how…
btatarov
  • 657
  • 1
  • 5
  • 8
0
votes
1 answer

what are the dotnet libraries for convex optimization?

Would you recommend any convex optim libraries ? Ideally opensource. A priori for semidefinite programming and QCQP. (I intend to use it with fsharp but any dotnet would do)
nicolas
  • 9,549
  • 3
  • 39
  • 83
0
votes
2 answers

Line(s) Equidistant From Two Convex Polygons In 2D

Given two convex polygons in 2D space, how would you go about constructing the line segment(s ) which, at any point on the lines, is equidistant from the closest point of either convex polygon? I'm looking towards an implementation of Voronoi…
Eric G
  • 4,018
  • 4
  • 20
  • 23
0
votes
1 answer

Android object's convex look

I am new to android animations, so if someone can help me, I want to transform an object, lets say a rectangle to have a convex look. Can I do that with some of the functions, like lets say skew or... If someone has an idea or a sample code I would…
Sandra
  • 4,239
  • 10
  • 47
  • 80
0
votes
1 answer

Fast Convex Integer Non linear programming python solver

I have a convex non-linear integer program of the following form: K is a fixed integer greater than 0. Betas are real numbers greater than zero. Note that x is a positive integer and the function to be optimized as well as the constraint are…
0
votes
0 answers

Automatically find piecewize functions breakpoints?

Let's imagine that I have an exponential function, is there a library that can find the best breakpoints and the best piecewize functions, and above all give me the coordinates of the breakpoints? Pwlf is nice but doesn't give the breakpoints…
harmonius cool
  • 337
  • 1
  • 2
  • 23
0
votes
0 answers

Linear vs convex relationship: testing which one fits better

I performed a Mantel regression test between two distance matrices, using residuals to control for a third variable. The Mantel test shows a significant relationship between my two variables (residualsA vs residualsB). However, when I plot…
Tweety
  • 11
  • 2