From: njh <nj...@nj...> - 2007-04-14 23:37:56
|
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. > > > That's what I thought at first, however, I'm not sure how that interacts > with combining sbasis. This would mean that any C0, C1 pw could be a single > sbasis. This may indeed be possible, however, we will need to do some cost > weighing in the function - a combination isn't valuable if it produces a > large coefficient count while reducing precision. Sorry, I managed to leave an 's' off: Compute the all the left and right derivatives on the edge and if they are sufficiently equal, the curves are sufficiently equal. > The nice thing about having a periodic class like this is that you can > control what can be done with periodics - you can't perform an operation on > two periodics (might have nearly irrational period ratios), you can't cast > periodics to anything else. All it can do is render itself useful to > something finite. There are still problems though. Lets say, pw + > periodic. Outside the pw's intended domain, the periodicity will dissapear. Whereas lazy pws are always mergable. sounds good. njh |