# Tag Info

4

Theory Clustering is unlikely to work in this case because your red points are separated from each other by the green points. You could use more clusters, but this will require a lot of manual inspection and fiddling. A standard approach to this sort of problem is to use a nonlinear support vector machine. The idea, simply described, is that although your ...

3

I don't know if the following is a good idea. But it is an idea, and I hope that it helps. This problem can be recast to "find a function $f: \mathbb{R}^2\to \mathbb{R}$ and $z\in\mathbb{R}$ s.t. $f(x,y)-z \geq 0$ if the point $(x,y)$ is "inside", and negative otherwise. For the basis of $f$ you can pick tensor products of Legendre polynomials ...

0

You could also try an approach I have outlined below based on mimicking the discrete analogues of the Gauss map, the shape operator and its link to the principle directions and principle curvatures. Step 1. At a given point or cell $i_0$ from the grid, take the unit normal $\vec{n}_{i_0}$. Then determine the set $N(i_0)$ of all vertices and cells immediately ...

Top 50 recent answers are included