# ClipPolydata with points that are all around the polydata

**URL:** https://discourse.vtk.org/t/clippolydata-with-points-that-are-all-around-the-polydata/5337
**Category:** Support
**Created:** [March 6, 2021, 7:05pm UTC](https://discourse.vtk.org/t/clippolydata-with-points-that-are-all-around-the-polydata/5337 "2021-03-06T19:05:35Z")
**Posts on this page:** 1
**Showing post:** 4

<div class="post-metadata">

### Author: ![lassoan](https://discourse.vtk.org/user_avatar/discourse.vtk.org/lassoan/32/50_2.png) [@lassoan](https://discourse.vtk.org/u/lassoan)
#### Post date: [March 8, 2021, 3:00pm UTC](https://discourse.vtk.org/t/clippolydata-with-points-that-are-all-around-the-polydata/5337/4 "2021-03-08T15:00:51Z")

</div>

If you provide approximately one control point for every few triangles in the mesh and the curve is not self-intersecting and path search still fails them you have to fix errors in the mesh. A small hole or non-manifold edge can throw the algorithm off.

For more robust geodesic path search, which also provides superior results, because it can cut across surface cells (not just connecting mesh points) you could try this method:

> <https://twitter.com/nmwsharp/status/1337492932845244417?s=19>

It has C++ implementation with MIT license, so you could turn it into a VTK filter without redeveloping anything.

---

_[View the full topic](https://discourse.vtk.org/t/clippolydata-with-points-that-are-all-around-the-polydata/5337)._