# Pedigree ID for a new displacement filter

**URL:** <https://discourse.vtk.org/t/pedigree-id-for-a-new-displacement-filter/11355>\
**Category:** Development\
**Created:** [May 2, 2023, 2:06pm UTC](https://discourse.vtk.org/t/pedigree-id-for-a-new-displacement-filter/11355 "2023-05-02T14:06:14Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![Jens\_Munk\_Hansen](https://discourse.vtk.org/user_avatar/discourse.vtk.org/jens_munk_hansen/32/1215_2.png) [@Jens\_Munk\_Hansen](https://discourse.vtk.org/u/Jens_Munk_Hansen)\
**Post date:** [May 2, 2023, 2:06pm UTC](https://discourse.vtk.org/t/pedigree-id-for-a-new-displacement-filter/11355/1 "2023-05-02T14:06:14Z")

</div>

Hi Guys

I am working on a few potential new filters. I already speeded up the `vtkDistancePolyDataFilter` a bit, but would like to have a `vtkDisplacementFilter`, which also provides “Direction” in addition to “Distance” Point/Celldata. For performance reasons, it would be nice to decimate the data and only output a subset of the original points. Should I use the PedigreeIDs for this or do we already have a nice filter that I can use for decimation ensuring that any point is contained in what it is decimated from.