Hi

You can use a NeighborFinder to find points closer than a specified distance, then a VertexCreator to draw a line between the point pairs. Then use a CenterPointReplacer to replace the line with the point in the middle and finally a Matcher to get rid of duplicate geometries (necessary because the NeighborFinder in "Candidates only"-mode will return one feature per point, not per pair). It could look like something this:

David

Just wondering out loud here: doesn't one of the generalization algorithms in the Generalizer do this?

Feel free to test I did have a look, but the Generalizer does not seem to consider more than one feature at a time.

You can use the NeighborhoodAggregator to create aggregate features and then replace the aggregate by a point using the CenterPointReplacer.

I thought that too, but I can't find it. Without that I think David's solution is probably the best