Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.programming > #352

Closest-pair approach works fine

Show all headers | View raw

Thank you, Chris! This works very well in my 20-points-plus-outlier example.

Whether the informed selection for the removal step is required depends on
the ratio between the selected number of points and the total number. The
lower this ratio is, the more beneficial the informed selection is.
When using the informed selection, I removed the point which is closer to a
third one, as you suggested.

It should also be easy to adapt this to a non-euclidean geometry (such as
the earth’s surface) by simply modifying the distance function used for
finding both the closest pair and the third nearest neighbor.

Back to comp.programming | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread

Thread

Select well-distributed points from ill-distributed set Michael Schmid <michael.schmid@geod.baug.ethz.ch> - 2011-05-20 16:26 +0200
  Re: Select well-distributed points from ill-distributed set James Waldby <not@valid.invalid> - 2011-05-20 15:25 +0000
    Convex hull presents difficulties Michael Schmid <michael.schmid@geod.baug.ethz.ch> - 2011-05-23 15:02 +0200
  Re: Select well-distributed points from ill-distributed set "Chris Uppal" <chris.uppal@metagnostic.REMOVE-THIS.org> - 2011-05-21 10:56 +0100
    Closest-pair approach works fine Michael Schmid <michael.schmid@geod.baug.ethz.ch> - 2011-05-23 15:21 +0200
      Re: Closest-pair approach works fine "Chris Uppal" <chris.uppal@metagnostic.REMOVE-THIS.org> - 2011-05-23 14:49 +0100
        I like noise Michael Schmid <michael.schmid@geod.baug.ethz.ch> - 2011-05-24 08:32 +0200
          Re: I like noise Patricia Shanahan <pats@acm.org> - 2011-05-24 20:18 -0700
  Re: Select well-distributed points from ill-distributed set jebblue <n@n.nnn> - 2011-05-22 00:30 -0500

csiph-web