Jason (jcreed) wrote,

Over lunch tried a think a little bit about whether visvalingam's algorithm for polyline simplification would lend itself any kind of B-tree/R-tree-like structure into which I could insert/delete things in a reasonable amount of time and update the effective-area measurements at each affected vertex. But it seems like the number of vertices affected by a single insertion can be "essentially all vertices in the polyline" in pathological cases like a logarithmic spiral. So that's a bummer.
Tags: algorithms, geometry, maps

  • (no subject)

    Guy from Seattle team we've been working with showed up today at work; no matter how much I'm generally comfortable working with remote teams (and I…

  • (no subject)

    Sean's back in town --- good fun working with nonremote teammates.

  • (no subject)

    Sean's in town at work, good times.

  • Post a new comment


    Anonymous comments are disabled in this journal

    default userpic

    Your reply will be screened

    Your IP address will be recorded