Skip to main content
Mathematica

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

3
  • $\begingroup$ Looks great, will have to try it out when I get a bit more time. I have been struggling the last weeks to get the boundaries nicely highlighted and hope to get that implemented soon. Great work! Is it possible to win much speed by compiling, or is this problematic as one loses the use of the built in mesh functions that would have to be rewritten? $\endgroup$ Commented Apr 5, 2017 at 20:18
  • 1
    $\begingroup$ The SparseArray[] stuff definitely isn't compilable, and in this case, they're the least memory-intensive storage format. The fuzziness in this case is expected, since at the moment, one is only classifying mesh vertices according to which feature point is nearest. For a sharp boundary, one would need to be able to draw across mesh polygons that might get split. $\endgroup$ Commented Apr 5, 2017 at 22:11
  • $\begingroup$ That is exactly what is beating me, trying to split the polygons to get a sharper mesh. On smaller meshes I managed but larger ones (like the bunny) slowed things down enormously that one loses all the advantage of the speed of this algorithm. $\endgroup$ Commented Apr 6, 2017 at 3:10