A 'dime_orth_plan_undi_graph' represents a 4-planar orth_plan_undi_graph with
integer coordinates for nodes and bends and an heading associated to each border_step.
Currently, if a dime_orth_plan_undi_graph is initialized with a no 4-planar
orth_plan_undi_graph, a compression step is executed before applying the compaction
algorithm, in which the orthogonal representation is made 4-planar. So, a certain
number of border_steps could represent more than one border_step and then their
thickness indicate this number.
About the compaction algorithm, it is possible to chose among the follwing enumerate:
1 - FAST_COMPACTION execute a linear-time compaction using a
rectangularization and a DFS
2 - SLOW_COMPACTION execute a polynomial-time compaction using a
rectangularization and flow techniques
3 - FAST_REGULAR_COMPACTION_1 execute a linear-time compaction using a regularization
with "heuristic 1" and a DFS
4 - SLOW_REGULAR_COMPACTION_1 execute a polynomial-time compaction using a regularization
with "heuristic 1" and flow techniques
5 - FAST_REGULAR_COMPACTION_2 execute a linear-time compaction using a regularization
with "heuristic 2" and a DFS
6 - SLOW_REGULAR_COMPACTION_2 execute a polynomial-time compaction using a regularization
with "heuristic 2" and flow techniques
Once that the dime_orth_plan_undi_graph has been initialized, it is manteined rectangularized.
Nodes and edges added by rectangularization algorithm are marked as
RM3_ADDED_BY_RECTANGULARIZATION.

*
Page generated from source code by SCP Source Code Publisher.*

SCP © INTEGRA Sistemi, www.IntegraSistemi.com