Namely each edge can have a certain number of right or/and left turns (bends), represented by the enumerate: 'bend_type' = {right, left, stright}.

Also, five different kind of angle are possible in a vertex: 0, 90, 180, 270, 360, represented by the following enumerate: 'angle_type' = {_000,_090, _180, _270, _360} (defined in rm3_global.h).

Three different kinds of 'bend_constraint' are possible for an edge:

- ANY = any number of bends on edge;
- NONE = no bends on edge;
- MINIMAL = a 'minimal' number of bends on edge (deafult).

- PLAN_ORTH_QUICK = a heuristic for bend-minimization within the given embedding (linear-time); only for 4-planar and biconnected
- PLAN_ORTH_OPTIMAL = an optimal bend-minimization within the given embedding (polynomial-time); variation of Tamassia's algorithm also considering the bend-constraints
- PLAN_ORTH_SLOW = an optimal bend-minimization no-preserving the embedding (exponential-time); based on a branch and bound technique and considering the bends-constraints

SCP © INTEGRA Sistemi, www.IntegraSistemi.com