From: njh <nj...@nj...> - 2007-04-14 22:47:44
|
On Sat, 14 Apr 2007, mgsloan wrote: > Sounds good! Yeah, one thing that might be nice would be an algorithm to > find combinable, adjacent segments, and do combine them. Hopefully it can > be written in such a way that it works for both 1d and 2d (eg, write 1d > accuracy and combination algos, then do a 1d and 2d optimizer). Compute the all the left and right derivative on the edge and if they are sufficiently equal, the curves are sufficiently equal. > Sounds like most of that is yours/jfs domain. As for the compose with > periodics, first off, we'd need a periodics class which stores offset, > period, and a pw or an sb for the period. Given a portion operation which > returns a pw of an interval of the periodic, composing (periodic . pw) would > become (pw . pw). Composing (pw . periodic) would result in a periodic, and > would essentially be the inner sb/pw composed with the first pw. So, I > think periodic stuff can be managed fairly quickly. They allow fairly easy > segment count explosion, though, if you go high-frequency and compose with a > pw. Right, the main value is for things like wiggles, which are periodic. The other discus-ed idea was lazy sbs such as pseudo-random, perlin, most higher functions (sqrt, e.g.) etc. njh |