The gridding algorithm

• Hierarchical (coarse-to-fine) procedure

  • 1) seed fill patch (restrict searches)
  • 2) compute initial guess for the iso-curves
    • Dijkstra's shortest-path algorithm
  • 3) Refine mesh using arc length and fairness criteria (relaxation)
  • 4) Subdivide spring mesh
  • 5) Repeat 3) and 4) until density of spring mesh approaches density of polygonal patch