<p><em>This is a suggestion for some directions, rather than an answer.</em> </p>

<p>The problem you ask seems closely related to the problem of polygon simplification (<a href="http://portal.acm.org/citation.cfm?id=1096373" rel="nofollow">here's one possible starting point for tracking references</a>) which comes in two flavors. The set up there is that you're given a polygon (or a curve for that matter) and you wish to simplify it. Your parameters are the error $\epsilon$ and the number of segments in the simplification $k$, and you can fix one or the other (the problem structure and solutions change accordingly). </p>

<p>If we consider the plane for now, here's an idea towards an approximation algorithm. Let's construct a subroutine that takes fixed parameters $\epsilon, k$ and determines whether an $\epsilon$-kernel exists. We will then binary search to get some approximation of the true $\epsilon$. We can do this because all we need to do is approximate the convex hull of the input point set, and if this convex hull size is strictly smaller than $k$, we can place a lower bound on $\epsilon$ (since at least some adjacent pair of edges in the hull will need to be shortcircuited). </p>

<p>So how to create the subroutine ? Firstly, if $\epsilon$ is the correct answer, then you know that the kernel's convex hull must lie within a "shrinking" of the original hull by $\epsilon$ (formally, by running a minkowski sum with a hemisphere of radius $\epsilon$ on the inside). Compute this region. </p>

<p>I'll then claim that a greedy strategy should work to verify whether you can solve the problem with $k$ points: the intuition is that convexity should ensure you don't need to backtrack. This idea comes from the polygonal simplification land. </p>

<p>Note that even if the above works, and I'm not more than 60% sure it will, it says nothing about hardness. </p>

CC BY-SA 2.5
2010-09-16T16:36:40.063Z
2010-09-16T16:36:40.063Z
Suresh Venkat
<p>Jeff Philips has a related result showing the stability of kernels: <a href="http://www.cs.utah.edu/~jeffp/papers/stable-kernel.pdf">http://www.cs.utah.edu/~jeffp/papers/stable-kernel.pdf</a>.</p>

<p>As for the problem itself, it can be formulated as a hitting set problem. Indeed, you need to pick a point into the kernel for each "complement of a slab" that contains $\geq \epsilon_k$ fraction of the input points. Here $\epsilon_k$ is the minimum $\epsilon$ that has a kernel of size $k$. Since this is just a hitting set problem, it can be approximated up to $O( \log k)$ factor in geometric settings. You need to guess the value of $\epsilon_k$, but naively just do a binary search on epsilon. As such, one can get two results:</p>

<ul>
<li>A set of size $O( k \log k)$ that is an $\epsilon_k$ kernel.</li>
<li>A set of size k that is  an $\epsilon_{O(k/\log k)}$ kernel.</li>
</ul>

<p>The algorithm for computing the set cover is the reweighting algorithm. In fact, the original paper by Clarkson solves a related problem about polytope approximation:</p>

<p>@inproceedings{c-apca-93,
  author       = "Kenneth L. Clarkson",
  title        = "Algorithms for Polytope Covering and Approximation",
  booktitle    = "Proc. 3rd Workshop Algorithms Data Struct.",
  series       = LNCS,
  volume       = 709,
  publisher    = "Springer-Verlag",
  year         = 1993,
  pages        = "246--252"
}</p>

<p>As for what to implement, i would use an incremental algorithm that performs quite well in practice, and add points an incremental fashion. See for example, the paper "Robust Shape Fitting via Peeling and Grating Coresets" and references therein.</p>

<p>it seems believable BTW that one should be able to do constant factor approximation instead of logarithmic.</p>

<p>I dont know of a formal proof that this problem is NP-hard, but it would be very surprising if it is not, IMHO.</p>

<p>The problem is probably solvable exactly in the plane using dynamic programming, I think....</p>

CC BY-SA 2.5
2010-09-19T09:21:17.050Z
... you need to pick a point into the kernel for each "complement of a slab"... Could you elaborate this point or give some references please?
Dan
CC BY-SA 2.5
2010-09-22T00:07:22.197Z
Sure. Consider a direction $v$, and consider the projection of the point set into the line spanned in the direction of v. Consider the smallest interval, say $I$, that contains the projected points on this line. Now, consider any interval $J$ that is contained inside $I$, such that $len(J) < (1-\eps)len(I)$. Such an interval defines a slab $S_J$ (i.e., consider the region between the two hyperplanes passing through the endpoints of $I$ that are perpendicular to $v$). Clearly, the kernel must contain a point outside $S_J$. Otherwise, is a dir (i.e., $v$) for which the $\epsilon$-kernel fails.
Sariel Har-Peled
CC BY-SA 2.5
2010-10-02T13:29:40.213Z
Thank you for your answer and clarification! So I guess the conclusion is the following (please correct me if I'm wrong). We can get $\log k $-approximation in the sense of output size or get $\epsilon_{k/\log k}$ instead of $\epsilon_k$. However, approximating $\epsilon_k$ while maintaining the output size to be $k$ is still open. It's not even known if the problem is NP-hard. (It should be in general but it might not be in the case of plane.)
Dan
CC BY-SA 2.5
2010-10-03T06:49:12.333Z
Yes. Thats the state as far as I know it.
Sariel Har-Peled
CC BY-SA 2.5
2010-09-16T19:12:54.753Z
2010-09-17T03:23:16.020Z
2010-09-17T03:23:16.020Z
Sariel Har-Peled
<p>The notion of $\epsilon$-kernel, as defined by Agarwal et al. ("Approximating extent measures of points"), is the following. </p>

<p>Let $S^{d−1}$ denote the unit sphere centered at the origin in $R^d$. For any set $P$ of points in $R^d$ and any direction $u \in S^{d−1}$, we deﬁne the <em>directional width</em> of $P$ in direction $u$, denoted by $\omega(u, P)$, to be </p>

<p>$\omega(u, P)=\max_{p\in P} \langle u, p \rangle  - \min_{p\in P} \langle u, p \rangle$</p>

<p>where $\langle \cdot, \cdot\rangle $ is the standard inner product. Let $\epsilon > 0$ be a parameter. A subset $Q \subseteq P$ is called an $\epsilon$-kernel of $P$ if for each $u \in S^{d−1}$, $(1 − \epsilon)\omega(u, P) \leq \omega(u, Q)$.</p>

<p>It was shown that one can compute an $\epsilon$-kernel of $P$ of size $O(1/\epsilon^{(d−1)/2})$ in time $O(n + 1/\epsilon^{d−(3/2)})$. (Chan, "Faster coreset constructions and data stream algorithms in ﬁxed dimensions".)</p>

<p>I am looking at the problem that is the reverse of this: Let $k$ be a parameter. I want to find an $\epsilon$-kernel of size at most $k$ such that $\epsilon$ is minimized. The running time could be exponential in $d$ but should be polynomial in $k$.</p>

<p>My general question is whether there is anything known for this problem. Some specific questions: 
1. Is the problem NP-hard when d=2? (Any clue what problem we can reduce from?)
2. Is there any approximation algorithm for d=2?  </p>

<p>Any general comments are also welcomed. </p>

CC BY-SA 2.5
2010-09-16T11:50:55.733Z
Part of the definition of ω(_u_,_P_) seems to be missing (although I can imagine what should be written).  Please verify that your question is posted as you intended, because posts are sometimes garbled because of some kind of technical limitation, which I know little about.
Tsuyoshi Ito
<cg.comp-geom>
Optimizing $\epsilon$ in $\epsilon$-kernel
Dan
# Optimizing $\epsilon$ in $\epsilon$-kernel

(Asked by: username_0 on 2010-09-16)

The notion of $\epsilon$-kernel, as defined by Agarwal et al. ("Approximating extent measures of points"), is the following.

Let $S^{d−1}$ denote the unit sphere centered at the origin in $R^d$. For any set $P$ of points in $R^d$ and any direction $u \in S^{d−1}$, we deﬁne the *directional width* of $P$ in direction $u$, denoted by $\omega(u, P)$, to be

$\omega(u, P)=\max\_{p\in P} \langle u, p \rangle - \min\_{p\in P} \langle u, p \rangle$

where $\langle \cdot, \cdot\rangle $ is the standard inner product. Let $\epsilon > 0$ be a parameter. A subset $Q \subseteq P$ is called an $\epsilon$-kernel of $P$ if for each $u \in S^{d−1}$, $(1 − \epsilon)\omega(u, P) \leq \omega(u, Q)$.

It was shown that one can compute an $\epsilon$-kernel of $P$ of size $O(1/\epsilon^{(d−1)/2})$ in time $O(n + 1/\epsilon^{d−(3/2)})$. (Chan, "Faster coreset constructions and data stream algorithms in ﬁxed dimensions".)

I am looking at the problem that is the reverse of this: Let $k$ be a parameter. I want to find an $\epsilon$-kernel of size at most $k$ such that $\epsilon$ is minimized. The running time could be exponential in $d$ but should be polynomial in $k$.

My general question is whether there is anything known for this problem. Some specific questions:
1. Is the problem NP-hard when d=2? (Any clue what problem we can reduce from?)
2. Is there any approximation algorithm for d=2?

Any general comments are also welcomed.

**Tags:** cg.comp-geom

> **Comments:**
> **username_1**: Part of the definition of ω(_u_,_P_) seems to be missing (although I can imagine what should be written).  Please verify that your question is posted as you intended, because posts are sometimes garbled because of some kind of technical limitation, which I know little about.  

---

## 2 answers

### Answer by username_3 on 2010-09-16. Score: 9 | Accepted answer

Jeff Philips has a related result showing the stability of kernels: <http://www.cs.utah.edu/~jeffp/papers/stable-kernel.pdf>.

As for the problem itself, it can be formulated as a hitting set problem. Indeed, you need to pick a point into the kernel for each "complement of a slab" that contains $\geq \epsilon\_k$ fraction of the input points. Here $\epsilon\_k$ is the minimum $\epsilon$ that has a kernel of size $k$. Since this is just a hitting set problem, it can be approximated up to $O( \log k)$ factor in geometric settings. You need to guess the value of $\epsilon\_k$, but naively just do a binary search on epsilon. As such, one can get two results:

* A set of size $O( k \log k)$ that is an $\epsilon\_k$ kernel.
* A set of size k that is an $\epsilon\_{O(k/\log k)}$ kernel.

The algorithm for computing the set cover is the reweighting algorithm. In fact, the original paper by Clarkson solves a related problem about polytope approximation:

@inproceedings{c-apca-93,
author = "Kenneth L. Clarkson",
title = "Algorithms for Polytope Covering and Approximation",
booktitle = "Proc. 3rd Workshop Algorithms Data Struct.",
series = LNCS,
volume = 709,
publisher = "Springer-Verlag",
year = 1993,
pages = "246--252"
}

As for what to implement, i would use an incremental algorithm that performs quite well in practice, and add points an incremental fashion. See for example, the paper "Robust Shape Fitting via Peeling and Grating Coresets" and references therein.

it seems believable BTW that one should be able to do constant factor approximation instead of logarithmic.

I dont know of a formal proof that this problem is NP-hard, but it would be very surprising if it is not, IMHO.

The problem is probably solvable exactly in the plane using dynamic programming, I think....

> **Comments:**
> **username_0**: ... you need to pick a point into the kernel for each "complement of a slab"... Could you elaborate this point or give some references please?  
> **username_3**: Sure. Consider a direction $v$, and consider the projection of the point set into the line spanned in the direction of v. Consider the smallest interval, say $I$, that contains the projected points on this line. Now, consider any interval $J$ that is contained inside $I$, such that $len(J) < (1-\eps)len(I)$. Such an interval defines a slab $S_J$ (i.e., consider the region between the two hyperplanes passing through the endpoints of $I$ that are perpendicular to $v$). Clearly, the kernel must contain a point outside $S_J$. Otherwise, is a dir (i.e., $v$) for which the $\epsilon$-kernel fails.  
> **username_0**: Thank you for your answer and clarification! So I guess the conclusion is the following (please correct me if I'm wrong). We can get $\log k $-approximation in the sense of output size or get $\epsilon_{k/\log k}$ instead of $\epsilon_k$. However, approximating $\epsilon_k$ while maintaining the output size to be $k$ is still open. It's not even known if the problem is NP-hard. (It should be in general but it might not be in the case of plane.)  
> **username_3**: Yes. Thats the state as far as I know it.  

---

### Answer by username_2 on 2010-09-16. Score: 4

*This is a suggestion for some directions, rather than an answer.*

The problem you ask seems closely related to the problem of polygon simplification ([here's one possible starting point for tracking references](http://portal.acm.org/citation.cfm?id=1096373)) which comes in two flavors. The set up there is that you're given a polygon (or a curve for that matter) and you wish to simplify it. Your parameters are the error $\epsilon$ and the number of segments in the simplification $k$, and you can fix one or the other (the problem structure and solutions change accordingly).

If we consider the plane for now, here's an idea towards an approximation algorithm. Let's construct a subroutine that takes fixed parameters $\epsilon, k$ and determines whether an $\epsilon$-kernel exists. We will then binary search to get some approximation of the true $\epsilon$. We can do this because all we need to do is approximate the convex hull of the input point set, and if this convex hull size is strictly smaller than $k$, we can place a lower bound on $\epsilon$ (since at least some adjacent pair of edges in the hull will need to be shortcircuited).

So how to create the subroutine ? Firstly, if $\epsilon$ is the correct answer, then you know that the kernel's convex hull must lie within a "shrinking" of the original hull by $\epsilon$ (formally, by running a minkowski sum with a hemisphere of radius $\epsilon$ on the inside). Compute this region.

I'll then claim that a greedy strategy should work to verify whether you can solve the problem with $k$ points: the intuition is that convexity should ensure you don't need to backtrack. This idea comes from the polygonal simplification land.

Note that even if the above works, and I'm not more than 60% sure it will, it says nothing about hardness.


---

