Computer Science Stack Exchange
Computer Science Stack Exchange

Questions tagged [convex-hull]

53 questions
9
votes
2 answers

If a convex optimization problem can be NP-Hard, in what sense are convex problems easier than non-convex problems?

Being new to the OR and Optimization world, I've always assumed that a problem being convex meant that it can be solved in polynomial time. Now I am learning that a convex optimization problem can be NP-Hard, but that convex problems are still…
Sasha the Noob
  • 643
  • 1
  • 7
  • 9
7
votes
1 answer

How to find the supremum over all the "good" (interior) polytopes for a given set of 3D points?

Let $S \subset \mathbf{R}^3$ be a set of points in 3D and let $O=(x_0,y_0,z_0)$ be the origin/point of reference. We consider a convex polytope $P$ good / interior if: $P$ is wholly contained within the interior of the convex hull of $S$: $P…
0x90
  • 259
  • 1
  • 13
6
votes
0 answers

$3$-dimensional convex hull using only a desired number of planes

I would like to find the convex polytope with the smallest volume that envelops (contains) all the points of a given 3D point cloud and that can be constructed from only $k$ planes. This is similar to the convex hull problem, except that the convex…
balt
  • 61
  • 1
5
votes
1 answer

Optimization over convex combinations in a circle

Consider the following situation: given a triangle $ABC$ inscribed in a circle, define $f$ as the product $$f(P) = d(P, A) \; d(P,B) \; d(P,C)$$ where $P$ is a point on the circle and $d$ are distances between points. Now, every point $D$ in the…
Drew
  • 51
  • 3
5
votes
2 answers

The optimal complexity of intersecting a line with a convex hull of a set of points in 2d

The problem: in 2d, given a line and an unordered set of $N$ points with real coordinates, find the intersection between the line and the convex hull of the points. Clearly, one can explicitly construct the convex hull and find the answer in $O(N…
hidanom
  • 83
  • 5
4
votes
1 answer

Convex-hull of a star shaped polygon in O(n)

I'm trying to develop an algorithm to find a convex hull of a star shaped polygon in $O(n)$ time. The specific problem, which is also described here, is as follows: A polygon $P$ is star-shaped if there exists a point $p$ in the interior of $P$…
user20691
4
votes
2 answers

Closest point on a convex hull in log(n)

We are given a convex polygon $C = \{P_1, P_2, \dots, P_n\}$, where the points are ordered either clockwise or counter-clockwise. Additionally, we have a point $P_\text{new} = (x, y)$ that lies outside the convex hull. The goal is to find the point…
amy
  • 43
  • 2
4
votes
0 answers

Minimal set of inequalities including good points but excluding bad points

Suppose I have a collection of good convex sets and bad convex sets in $\mathbb{R}^d$ (where $d$ can be big). Each convex set is defined by a series of closed ranges in each dimension $d$ - a hyperrectangle if you will. For 2D an example set could…
orlp
  • 13,988
  • 1
  • 26
  • 41
4
votes
0 answers

Distance from high dimensional convex hull to target point T

I have a set S of high dimensional points in Euclidean space, with convex hull H (not known); and some target point T in that space not in or on H. Rather than worry about calculating both H and the distance to it explicitly, is there an efficient…
jdowdell
  • 141
  • 3
4
votes
0 answers

Convex hull in a discrete space

I know some algorithms which compute the convex hull in a continuous space. Are there efficient algorithms to compute it in a discrete domain? For example in 3D discrete space, given the blue points, we want the convex hull including the green…
Smith
  • 41
  • 1
4
votes
2 answers

3D gift wrapping algorithm: how to find the first face in the convex hull?

I am implementing the gift wrapping algorithm to find the convex hull of a set of points in the 3D space. However, all the articles I have read seem to omit the description of the first step of the algorithm; namely, finding a face (that is, a…
shdown
  • 41
  • 2
3
votes
1 answer

Is binary-search really required in Chan's convex hull algorithm?

I have a little doubt about Chan's algorithm. From Wikipedia's description we see that the second phase of an algorithm works with $K = \mathrm{ceil}(\frac{n}{m})$ subsets $Q_i$. The goal of the second phase is to compute $m$ points $\{p_1 ...…
Y N
  • 247
  • 1
  • 7
3
votes
1 answer

Why is the graph inside Graham Scan always planar

One of the ways to prove that Graham Scan constructs convex hull in linear time is using planarity of the graph obtained by running the algorithm. This graph is always planar, so according to Euler's formula the number of edges can never be more…
PiMan
  • 151
  • 7
3
votes
1 answer

Convex hull algorithm in $O(\min(mn, n\log n))$

I am looking for an algorithm to compute the convex hull of a set of $n$ points $P$. The hull should contains $m$ points. This algorithm should work in time $O(\min(mn,n \log n))$. My first guess was QuickHull, which has a best case running time of…
今天春天
  • 269
  • 1
  • 6
3
votes
1 answer

How to use convex hull for this problem

Problem: You are to collect a total of $N$ litres of red and $M$ litres of blue liquid. For doing job $i$ for time $t$, you get $a_i t$ litres of red and $b_i t$ litres of blue liquid. $t$ need not be an integer. At a time you can only do one job.…
e_noether
  • 1,329
  • 2
  • 13
  • 19
1
2 3 4