Created: | 10-04-2008 12:16:12 |
Modified: | 28-05-2009 08:47:45 |
![]() |
|
![]() |
Operation | ||
Public isMaximal():Boolean |
||
![]()
Sequential
|
Element | Source Role | Target Role |
«type» TP_Complex Class |
Name: geometry |
Name: topology |
![]() |
||
«type» GM_Complex Class |
Name: superComplex |
Name: subComplex |
![]() 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_Primitive Class |
Name: complex |
Name: element |
![]() A GM_Primitive may be in several GM_Complexes. See Clause 6.6.2.This association may not be navigable in this direction, depending on the application schema. <br /></p><p>GM_Primitive::complex [0..*] : Reference<GM_Complex><br /></p>
|
Element | Source Role | Target Role |
«type» GM_Complex Class |
Name: superComplex |
Name: subComplex |
![]() 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>
|
Tag | Value |
persistence | persistent |
![]() |
Object | Type | Connection | Direction | Notes |
«Abstract» GM_Boundary | Class | Realization | From | |
«type» GM_Composite | Class | Generalization | From | |
«type» GM_Object | Class | Generalization | To |