Created: | 23.5.2022 18.05.06 |
Modified: | 1.8.2022 13.54.06 |
![]() |
|
![]() |
Attribute |
Public Topology asSet |
![]() |
Public Boolean isConnected |
![]() |
Public Boolean isMaximal |
![]() |
Operation | ||
Public Complex( ![]() |
||
![]()
Sequential <<create>>
|
Element | Source Role | Target Role |
Complex Interface |
Name: topology |
Name: geometry |
![]() |
||
Complex Interface |
Name: subComplex |
Name: superComplex |
![]() subcomplex (of a larger complex)<br/>complex all of whose elements are also in the larger complex<br/><br/>NOTE: Since the definition of complex requires only that the boundary operator be closed, then the set of any primitives of a particular dimension and below is always a subcomplex of the original, larger complex. Thus, any full planar topological complex contains an edge-node graph as a subcomplex.<br/>
|
Element | Source Role | Target Role |
Primitive Interface |
Name: element |
Name: |
![]() |
||
Topology Interface |
Name: |
Name: maximalComplex |
![]() |
||
Complex Interface |
Name: subComplex |
Name: superComplex |
![]() subcomplex (of a larger complex)<br/>complex all of whose elements are also in the larger complex<br/><br/>NOTE: Since the definition of complex requires only that the boundary operator be closed, then the set of any primitives of a particular dimension and below is always a subcomplex of the original, larger complex. Thus, any full planar topological complex contains an edge-node graph as a subcomplex.<br/>
|
Tag | Value |
persistence | persistent |
![]() |
Property | Value |
isFinalSpecialization: | 0 |
Object | Type | Connection | Direction | Notes |
«type» TP_Complex | Class | Dependency | From | |
«datatype» SimplicialComplex | DataType | Realization | From | |
Topology | Interface | Generalization | To | |
Graph | Class | Realization | From |