Stack Overflow
Stack Overflow

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

how to vectorize julia Convex inequality constraints

I'm trying to vectorize an inequality constraint comparing two Convex types. On one side, I have Convex.MaxAtoms, and on the other side, I have Variables. I want to do something like the following: using Convex N = 10 t = Variable(1) v =…
jjjjjj
  • 1,152
  • 1
  • 14
  • 30
1
vote
1 answer

initialize Convex.MaxAtom array Julia

How can I create an Array of Convex.MaxAtoms (or for that matter, other Convex types) with the Convex package? I'm not sure if an Array is the right structure, but what I want to do is initialize something my_array of length n so that I can update…
jjjjjj
  • 1,152
  • 1
  • 14
  • 30
1
vote
1 answer

Computer Vision techniques for geometrical information

I am trying to research and implement some computer vision techniques e.g. motion tracking for a set of arbitrary points in 2D. I am producing a convex hull for the set of points I know and a convex hull for the set of points that it could…
Rick
  • 73
  • 1
  • 3
1
vote
1 answer

Dividing space outside of convex polygons into horizontally spanning quadrilaterals

I'm looking for an algorithm that can take an area containing a set of non-overlapping convex polygons as input, and break the space outside of the polygons into a set of non-overlapping convex quadrilaterals. The quadrilaterals need to have the…
oceanic
  • 59
  • 4
1
vote
1 answer

A Linear Program for Detecting Extreme Points of a Convex Hull

How can we formulate a linear programme that tells us whether an arbitrary point x[ j ] ∈ X, where X = {x1, ... ,xn} ⊂ Rn is an extreme point of the convex hull of X, that is conv(X)? According to the solution of this linear programme, we should be…
Izzy
  • 21
  • 4
1
vote
0 answers

Lee's algorithm for convex hull of a simple closed polygon

I need a fast algorithm to find the convex hull of large simple closed polygons. The algorithm of Lee (as described in here, Section 2.1) is fine in most, but not all cases. For instance, the clockwise polygon…
PAF
  • 23
  • 4
1
vote
1 answer

How to check if the Polygon is Concave or Convex?using openGL

How to check if the Polygon is concave or convex?using openGL. I take points as input from .txt file and I draw with these points a polygon then here comes the problem .. I need an algorithm to detect the type of the polygon .. concave or convex…
Snowb
  • 31
  • 1
  • 1
  • 5
1
vote
2 answers

Convex hull: known number of points but not points itself

I need to find an algorithm which computes a convex hull from a given set of points S of size n. I know that there are exactly 6 points from S which form the convex hull. What is the best and most efficient way to compute this? I thought about…
今天春天
  • 941
  • 1
  • 13
  • 27
1
vote
0 answers

How to store edges of convex polygon?

I'm making my own simple 2D-Game's engine and I want to use Separating Axis Theorem to detect collisions but it requires objects to be convex polygons and I would really love to be able to create these polygons in an easy way because every physical…
Android developer
  • 1,272
  • 1
  • 12
  • 17
1
vote
0 answers

How to extract a rectangular object from image in Java

I have a photo of a paper that I hold up to my webcam, and want to minimize the area of the photo to just the paper. This way, my OCR program will potentially be more accurate, as well as conceivably faster. I have taken a couple steps thus far to…
Sid G.
  • 100
  • 1
  • 9
1
vote
2 answers

Combine Nearest Convex Polygons

I have an array of pointclouds (a cluster of points that have been determined to be in their own region). The goal is to combine these individual clusters that are either i. Intersecting ii. Within some minimum distance from eachother Check ii…
DaynaJuliana
  • 1,144
  • 1
  • 14
  • 33
1
vote
1 answer

Creating a smaller convex hull algorithm, can it be done with 1 loop?

I've created a working convex hull program that is able to draw the points and lines and everything required to make it visually appealing. My question, is there a way to design it so that only one for loop is needed? Instead of making a upper and…
Psychosupreme
  • 63
  • 5
1
vote
1 answer

How to compute the intersection between a convex polyhedron and another polyhedron?

The problem at hand is part of a scientific simulation concerned with 2D growth within 3D space. The 2D shape grows by adding (triangular) segments to the previously grown shape. Note that the actual segments in 3D have a thickness, thus, my code…
Merlin
  • 11
  • 3
1
vote
2 answers

Geometry rounding problems: object no longer convex after simple transformations

I'm making a little app to analyze geometry. In one part of my program, I use an algorithm that has to have a convex object as input. Luckily, all my objects are initially convex, but some are just barely so (see image). After I apply some…
bombax
  • 1,189
  • 8
  • 26
1
vote
1 answer

Field of view/ convexity map

On a shape from a logical image, I am trying to extract the field of view from any point inside the shape on matlab : I tried something involving to test each line going through the point but it is really really long.(I hope to do it for each…
Jimolrame
  • 15
  • 5
1 2 3
…
9 10