Enum Domain.TriangulationMethod
The TriangulationMethod class represents the triangulation method used for this Domain.
Namespace: HAPI
Assembly: hugincs-9.7-netstandard2.0-x64.dll
Syntax
public enum Domain.TriangulationMethodRemarks
Triangulation is the process of transforming the graph of a Domain to a triangulated graph, which forms the basis for constructing the JunctionTree of the Domain.
| H_TM_CLIQUE_SIZE | Represents the clique-size triangulation heuristic. As its score function, this heuristic uses the size of N(v), where N(v) is the set of neighbors of the target node v (i.e., the node to be eliminated next in the elimination order used for triangulating the graph). |
| H_TM_CLIQUE_WEIGHT | Represents the clique-weight triangulation heuristic.
As its score function, this heuristic uses the product of the number of states of the discrete
nodes in N(v) multiplied by a + bm(m + 3)/2, where m is the number of continuous nodes in N(v),
a and b are the size of the types h_number_t and h_double_t, respectively, and N(v) is the set
of neighbors of the target node v (i.e., the node to be eliminated next in the elimination
order used for triangulating the graph). |
| H_TM_FILL_IN_SIZE | Represents the fill-in triangulation heuristic. As its score function, this heuristic uses the number of fill-in links required to complete the neighbors of a target node (i.e., the node to be eliminated next in the elimination order used for triangulating the graph). |
| H_TM_FILL_IN_WEIGHT | Represents the fill-in-weight triangulation heuristic. As its score function, this heuristic uses the sum of the weights of the fill-in links required to complete the neighbors of a target node (i.e., the node to be eliminated next in the elimination order used for triangulating the graph). |
| H_TM_TOTAL_WEIGHT | Represents the total clique-table size triangulation algorithm. This algorithm is also sometimes referred to as the optimal triangulation algorithm. See also SetMaxNumberOfSeparators(ulong). |
| H_TM_BEST_GREEDY | Represents the best-greedy triangulation heuristic. Triangulation is the process of transforming the graph of this Domain to a triangulated graph, which forms the basis for constructing the JunctionTree of the Domain. This heuristic tries all the greedy elimination heuristics and keeps the best result. |
Fields
| Name | Description |
|---|---|
| H_TM_BEST_GREEDY | |
| H_TM_CLIQUE_SIZE | |
| H_TM_CLIQUE_WEIGHT | |
| H_TM_FILL_IN_SIZE | |
| H_TM_FILL_IN_WEIGHT | |
| H_TM_TOTAL_WEIGHT |