Fdtxjr

Loading commands from file

Electoral considerations aside, what are potential benefits, for the US, of policy changes proposed by the tweet recognizing Golan annexation?

Intuition of generalized eigenvector.

On a tidally locked planet, would time be quantized?

How do you respond to a colleague from another team when they're wrongly expecting that you'll help them?

Why do compilers behave differently when static_cast(ing) a function to void*?

Which one is correct as adjective “protruding” or “protruded”?

Why did the EU agree to delay the Brexit deadline?

What should you do when eye contact makes your subordinate uncomfortable?

It grows, but water kills it

Is it possible to have a strip of cold climate in the middle of a planet?

What if a revenant (monster) gains fire resistance?

What was the exact wording from Ivanhoe of this advice on how to free yourself from slavery?

Is it improper etiquette to ask your opponent what his/her rating is before the game?

What is the evidence for the "tyranny of the majority problem" in a direct democracy context?

How should I respond when I lied about my education and the company finds out through background check?

Closed-form expression for certain product

How to explain what's wrong with this application of the chain rule?

Is there a working SACD iso player for Ubuntu?

What is this called? Old film camera viewer?

Multiplicative persistence

GraphicsGrid with a Label for each Column and Row

If infinitesimal transformations commute why dont the generators of the Lorentz group commute?

Creepy dinosaur pc game identification

Smallest convex set containing given point

Convex hull problem with a twistTest if point is in convex hull of $n$ pointsDetermine 2D Convex Hull given 3D Convex HullAre all convex hulls polytopes too?Proving 2D Convex Hull propertiesFind a point on the convex hull of a given set of points which is closest to a given point.Intuition regarding convex hulls and convex combinationsHow to algorithmically find only the edges of a high dimensional convex hull?Convex hull of some points on the convex positionNumber of Sets of Points Containing a Given Point in its Convex Hull

-1

0

$begingroup$

Given a set $M$ of $m$ points in $R^n$, where the number of points $m$ is much larger than the dimension $n$, and given a point $x$ in $R^n$ that we may assume is in the convex closure of $M$, is there an (efficient) algorithm that finds $n+1$-subset of $M$ with smallest convex hull that contains $x$ (or, $k$-subset for some $k < n + 1$ if such exists)? "Smallest" is defined according to the volume in $R^n$ (or $R^k-1$). "Efficient" would imply something much better than the brute force strategy that examines all $n+1$-subsets of $M$. Thank you.

convex-geometry convex-hulls

share|cite|improve this question

edited Mar 15 at 17:04

Mahir

asked Mar 12 at 16:47

MahirMahir

11

$endgroup$

add a comment | 

-1

0

$begingroup$

Given a set $M$ of $m$ points in $R^n$, where the number of points $m$ is much larger than the dimension $n$, and given a point $x$ in $R^n$ that we may assume is in the convex closure of $M$, is there an (efficient) algorithm that finds $n+1$-subset of $M$ with smallest convex hull that contains $x$ (or, $k$-subset for some $k < n + 1$ if such exists)? "Smallest" is defined according to the volume in $R^n$ (or $R^k-1$). "Efficient" would imply something much better than the brute force strategy that examines all $n+1$-subsets of $M$. Thank you.

convex-geometry convex-hulls

share|cite|improve this question

edited Mar 15 at 17:04

Mahir

asked Mar 12 at 16:47

MahirMahir

11

$endgroup$

add a comment | 

$begingroup$

Given a set $M$ of $m$ points in $R^n$, where the number of points $m$ is much larger than the dimension $n$, and given a point $x$ in $R^n$ that we may assume is in the convex closure of $M$, is there an (efficient) algorithm that finds $n+1$-subset of $M$ with smallest convex hull that contains $x$ (or, $k$-subset for some $k < n + 1$ if such exists)? "Smallest" is defined according to the volume in $R^n$ (or $R^k-1$). "Efficient" would imply something much better than the brute force strategy that examines all $n+1$-subsets of $M$. Thank you.

convex-geometry convex-hulls

share|cite|improve this question

edited Mar 15 at 17:04

Mahir

asked Mar 12 at 16:47

MahirMahir

11

$endgroup$

share|cite|improve this question

edited Mar 15 at 17:04

Mahir

asked Mar 12 at 16:47

MahirMahir

11

share|cite|improve this question

edited Mar 15 at 17:04

Mahir

asked Mar 12 at 16:47

MahirMahir

11

asked Mar 12 at 16:47

MahirMahir

11

asked Mar 12 at 16:47

MahirMahir

11