Question: Accurate intersection for analytic curves about verb HOT 1 CLOSED

There are three stages to intersection:

1. Tessellation of the intersecting entities
2. A recursive, lazy AABB intersection of the two tesselations is performed to narrow down the potential intersection points
3. If intersection points are discovered, they are refined exactly using a gauss-newton procedure supplied by numeric.js.
4. A check for duplicate intersections is performed

Generally speaking, decreasing the tolerance will make all of these steps slower. Like I said before, the representations of conics is exact in NURBS, so these intersection routines will be similarly exact, bounded by the tolerance.

from verb.