| commit | b05a05a2ec315d9d8914e4023d855504a425c6db | |
| author | Henrik Tidefelt <tidefelt@isy.liu.se> | |
| Tue, 16 Jun 2009 22:06:28 +0000 (17 00:06 +0200) | ||
| committer | Henrik Tidefelt <tidefelt@isy.liu.se> | |
| Wed, 1 Jul 2009 12:51:37 +0000 (1 14:51 +0200) | ||
| tree | 2f1a55db529f2e7e0b37be81fb18fdfbc28a5a90 | treesnapshot (tar.gz zip) |
| parent | 18ab75606789f6277cd8cc4a694e5e287f0cfeb1 | commitdiff |
New example: Systematic testing of intersection (and approximation) algorithm(s).
The idea is that approximation should generalize intersection. Hence, the example now shows that the same intersections are obtained using approximation.
To also illustrate differences between the two methods to find intersections, the distance between points at optimum are computed also for the approximation solution, and these turn out to be bigger.
It should be remembered that computing intersections is still more efficient than approximation (when one knows that an intersection exists). It would be possible to improve the computation of approximators so that it switches to intersection-finding once one intersection has been found, but this is not implemented at the moment.
The idea is that approximation should generalize intersection. Hence, the example now shows that the same intersections are obtained using approximation.
To also illustrate differences between the two methods to find intersections, the distance between points at optimum are computed also for the approximation solution, and these turn out to be bigger.
It should be remembered that computing intersections is still more efficient than approximation (when one knows that an intersection exists). It would be possible to improve the computation of approximators so that it switches to intersection-finding once one intersection has been found, but this is not implemented at the moment.
| examples/features/intersections-other.shape | [new file with mode: 0644] | blob |