Class Name: Classification Related Features
Definition
An aggregation of Feature Hierarchies in
which each component Feature Hierarchy
represents a different thematic layer, or a different classification of
Features (e.g. roads, railroads) within a single
thematic layer. The Feature
Classification Data link object attached to
each component indicates its classification (based on EDCS Classification
Codes (ECCs)).
Primary Page in DRM Diagram:
Example
- Several thematic layers of features might be grouped using a
Classification Related
Features object, with each of its components representing a separate
thematic layer (e.g. culture, vegetation, etc.). In such a case, the
unique_descendants,
independent_topologies, and
strict_organizing_principle flags of the
Classification Related
Features object should all be set to true. The
Feature Classification Data link
object associated with each of its components would identify the contents
of each thematic layer.
A region consisting of forest and water is represented as a
Classification Related
Features with
strict_organizing_principle set to SE_TRUE, containing two
Union of Features components. The first,
containing the forest features, has a
Feature Classification Data
link object with a tag
value of EDCS_CC_FOREST, while
the second, containing the water features, has a
Feature Classification Data
link object with a tag
value of EDCS_CC_WATER.
- In the first example, suppose we have roads running through the forest.
Then we replace the forest Union of
Features with another
Classification Related
Features having 2 branches, one classified as
EDCS_CC_ROAD and the other as
EDCS_CC_FOREST, and the
strict_organizing_principle flag in example 1 is set to SE_FALSE,
because the forest branch at the coarse level contains non-forest
(i.e. road) features.
FAQs
- What is the purpose of this class?
- This class allows Features to be hierarchically
organized according to their SEDRIS classification codes.
Constraints
Associated by (one-way)(inherited)
Associated with (two-way)(inherited)
Composed of (one-way)(inherited)
- optionally, some {ordered} Attribute Set Indices
- optionally, a Classification Data
- optionally, some Colors
- optionally, some {ordered} Image Mapping Functions (notes)
- optionally, some Labels
- optionally, some Property Tables
- optionally, some Property Table References
- optionally, some Property Values
- optionally, a Rendering Priority Level
- optionally, a Spatial Domain
- optionally, a Reference Surface
- optionally, some Sound Instances
- optionally, some Property Descriptions
Composed of (two-way)(inherited)
Composed of (two-way)
Composed of (one-way metadata)(inherited)
Component of (two-way)(inherited)
- optionally, some Union of Features
- optionally, some Alternate Hierarchy Related Features through Feature Hierarchy Data
- optionally, some Classification Related Features through Feature Classification Data
- optionally, an Environment Root
- optionally, a Feature Model
- optionally, some Time Related Features through Feature Time Constraints Data
- optionally, some Level of Detail Related Features through Feature Level of Detail Data
- optionally, some Oct Tree Related Features through Feature Oct Tree Data
- optionally, some Perimeter Related Features through Feature Perimeter Data
- optionally, some Quad Tree Related Features through Feature Quad Tree Data
- optionally, some Spatial Index Related Features through Feature Spatial Index Data
- optionally, some State Related Features through Feature State Data
Notes
Composed of Notes
Added to support "attributes for derived objects."
That is, these components are used only to specify
texture mapping information for geometry that
is derived from the <Feature> by the consumer.
These <Image Mapping Functions> must use
<Image Anchor> components to specify the mapping.
Fields Notes
If true, then for any object that exists 'below' this aggregation,
each object will appear in only one 'branch' of this aggregation.
If false, then objects may appear in multiple 'branches' of this
aggregation.
If true, then each 'branch' from this aggregation is its own,
independent topology. If false, then all of the branches exist
within the same topology.
If true, then each 'branch' strictly follows the rules of this
aggregation. If false, then each 'branch' might bend the rules a bit.
For example, if this is a spatial aggregation, than a value of true
indicates that objects will *not* cross the spatial extents defined
by this aggregation relationship, and a value of false indicates
that objects might cross those bounds. For another example, if this
is a time-based aggregation, then a value of true indicates that all
branches will only contain data valid for the times specified for
each branch, and a value of false indicates that the branches have
the option of including data that falls outside of the specified
time ranges for that branch.
Prev: Classification Data.
Next: Classification Related Geometry.
Up:Index.