| Created: | 10/04/2008 12:16:11 |
| Modified: | 28/05/2009 08:14:51 |
Project: |
|
Advanced: |
|
| Operation | ||
|
Public boundary():TP_ComplexBoundary |
||
Details:
Sequential
|
||
|
Public closure():Set<TP_Primitive> |
||
Details:
Sequential
|
||
|
Public coBoundary():Set<TP_DirectedTopo> |
||
Details:
Sequential
|
||
|
Public dimension():Integer |
||
Details:
Sequential
|
||
|
Public exterior():Set<TP_Primitive> |
||
Details:
Sequential
|
||
|
Public interior():Set<TP_Primitive> |
||
Details:
Sequential
|
||
|
Public isConnected():Boolean |
||
Details:
Sequential
|
||
|
Public isMaximal():Boolean |
||
Details:
Sequential
|
||
|
Public maximalComplex():TP_Complex |
||
Details:
Sequential
|
||
|
Public TP_Complex( GC: GM_Complex,
|
||
Details:
Sequential
|
| Element | Source Role | Target Role |
|
«type» TP_Complex Class |
Name: |
Name: maximalComplex |
Details:
|
||
|
«type» TP_Complex Class |
Name: subComplex |
Name: superComplex |
Details:
subcomplex (of a larger complex)<br /></p><p>complex all of whose elements are also in the larger complex<br /></p><p><br /></p><p>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 /></p>
|
||
| Element | Source Role | Target Role |
|
«type» TP_Primitive Class |
Name: |
Name: maximalComplex |
Details:
|
||
|
«type» TP_Primitive Class |
Name: element |
Name: complex |
Details:
|
||
|
«type» TP_Complex Class |
Name: |
Name: maximalComplex |
Details:
|
||
|
«type» TP_Complex Class |
Name: subComplex |
Name: superComplex |
Details:
subcomplex (of a larger complex)<br /></p><p>complex all of whose elements are also in the larger complex<br /></p><p><br /></p><p>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 /></p>
|
||
|
«type» GM_Complex Class |
Name: geometry |
Name: topology |
Details:
|
||
| Tag | Value |
| persistence | persistent |
Details:
|
|
| Object | Type | Connection | Direction | Notes |
| «type» NT_Network | Class | Generalization | From | |
| «interface» TP_Object | Interface | Realization | To |