Difference between revisions of "Topology Level Codelist"
From DGIWG
| Line 4: | Line 4: | ||
| − | {| style="border-spacing:0;width: | + | {| style="border-spacing:0;width:30cm;" |
|- | |- | ||
! style="border:1pt solid #000000;padding:0.049cm;" | # | ! style="border:1pt solid #000000;padding:0.049cm;" | # | ||
Latest revision as of 17:07, 4 May 2021
Topology Level Codelist
The value domain of Topology Level Codelist is defined in the following table.
| # | Code | English Name | Definition | Source |
|---|---|---|---|---|
| 1 | geometryOnly | Geometry Only | Geometry objects without any additional structure which describes topology. | |
| 2 | topology1D | Topology 1D | 1-dimensional topological complex - commonly called "chain-node" topology | |
| 3 | planarGraph | Planar Graph | 1-dimensional topological complex that is planar. A planar graph is a graph that can be drawn in a plane in such a way that no two edges intersect except at a vertex. | |
| 4 | fullPlanarGraph | Full Planar Graph | 2-dimensional topological complex that is planar (A 2-dimensional topological complex is commonly called "full topology" in a cartographic 2D environment) | |
| 5 | surfaceGraph | Surface Graph | 1-dimensional topological complex that is isomorphic to a subset of a surface. A geometric complex is isomorphic to a topological complex if their elements are in a one-to-one, dimensional- and boundary-preserving correspondence to one another. | |
| 6 | fullSurfaceGraph | Full Surface Graph | 2-dimensional topological complex that is isomorphic to a subset of a surface. | |
| 7 | topology3D | Topology 3D | 3-dimensional topological complex. A topological complex is a collection of topological primitives that are closed under the boundary operations. | |
| 8 | fullTopology3D | Full Topology 3D | complete coverage of a 3D Euclidean coordinate space | |
| 9 | abstract | Abstract | topological complex without any specified geometric realisation. |
