Method hRefine2

plugin/seq/GeometryQA.cpp:166–223

  }

  Edge *Edge::hRefine2(double h, Tab< Edge > &EdgeAllocator, Tab< Vertex > &VertexAllocator,
                       const Metric2 &metric, safe_vector< Edge * > *recursive, bool exaggerate) {
    // in the case recursive=!NULL of a recursive split, the safe_vector recursive contains all
    // newly created edges which are oriented like *this.
    const R2 Vec = vec( );
    sym2 m = metric(*u);

    if (exaggerate) {
      m = m.exaggerate( );
    }

    double minSize = 1 / m.norm(Vec);

    if (metric.lip == 0) {
      if (h * minSize < 1) {
        Edge *const e = refine(EdgeAllocator, VertexAllocator, metric, selected_edge_first);
        if (recursive) {
          hRefine2(h, EdgeAllocator, VertexAllocator, metric, recursive, exaggerate);
          e->hRefine2(h, EdgeAllocator, VertexAllocator, metric, recursive, exaggerate);
          recursive->push_back(e);
        }

        return e;
      }

      return NULL;
    }

    // If the metric is not constant, it is sampled until resolution allows to make a sensible
    // choice (based on lip constant). Smallest eigenvalue used only.
    for (int pow = 1; h * (minSize - metric.lip / (2 * pow)) < 0.5;
         pow *= 2) {    // !!! condition should be checked
      for (int i = 0; i <= pow; i++) {
        if (i % 2 == 0) {
          continue;
        }

        m = metric((*u * i + *v * (pow - i)) / pow);
        if (exaggerate) {
          m = m.exaggerate( );
        }

        minSize = min(minSize, 1 / m.norm(Vec));
        if (h * minSize < 1) {
          Edge *const e = refine(EdgeAllocator, VertexAllocator, metric, selected_edge_first);
          if (recursive) {
            hRefine2(h, EdgeAllocator, VertexAllocator, metric, recursive, exaggerate);
            e->hRefine2(h, EdgeAllocator, VertexAllocator, metric, recursive, exaggerate);
            recursive->push_back(e);
          }

          return e;
        }
      }
    }

    return NULL;
  }