Last modified 2 years ago
Last modified on 05/07/10 15:10:39
Algorithms need to be tested for speed and accuracy. We will probably end up using different algorithms for different sorts of curves.
- "vertical lines" algorithm Unfinished, needs work on vertical asymptotes and vertical points
- parameterize curve and use the existing algorithm in DrawParametricCurve
- GCalc's algorithm In Java, so should be straightforward to implement Works with non-polynomial functions
- 2D Grapher's algorithm
- A Non-uniform Binary Space Partition Algorithm for 2D Implicit Curves NB Intersection with cubics and quartics already implemented, see AlgoIntersectLineCubic
- Quadtree-BasedImplicitCurve (Implicit Curves and Surfaces: Mathematics, Data Structures, and Algorithms) Algorithm won't cope with closed loops?
