Class Name: Oct Tree Related Geometry

Superclass - Aggregate Geometry

Definition

An aggregation of Geometry Hierarchies in which each component Geometry Hierarchy represents a branch of an Oct Tree. The octant represented by a branch is specified by the Geometry Oct Tree Data associated with that branch. The bounding region that the Geometry Hierarchy components occupy is defined by the Spatial Domain of the Oct Tree Related Geometry.

Primary Page in DRM Diagram:

Example

--Example needed here --

FAQs

If an Oct Tree Related Geometry has less than 8 components, why is the data being organized under an Oct Tree Related Geometry at all?
An Oct Tree Related Geometry is used when an object in the hierarchy contains spatial components that occupy a certain octant. These octants might not contain Primitive Geometry, which is why this class can have less than 8 components.

Where is the Spatial Domain component?
Oct Tree Related Geometry automatically has a Spatial Domain component, because it is a Geometry Hierarchy. Unlike Geometry Hierarchies in general, Oct Tree Related Geometry has a business rule stating that the Spatial Domain component is mandatory.

Constraints

Associated by (one-way)(inherited)

Associated with (two-way)(inherited)

Composed of (one-way)(inherited)

Composed of (two-way)(inherited)

Composed of (two-way)

Composed of (one-way metadata)(inherited)

Component of (two-way)(inherited)

Inherited Field Elements

SE_BOOLEAN unique_descendants; (notes)
SE_BOOLEAN independent_topologies; (notes)
SE_BOOLEAN strict_organizing_principle; (notes)

Notes

Fields Notes

unique_descendants

 If SE_TRUE, then for any object that exists 'below' this aggregation,
 each object will appear in only one 'branch' of this aggregation.
 If SE_FALSE, then objects may appear in multiple 'branches' of this
 aggregation.

independent_topologies

 If SE_TRUE, then each 'branch' from this aggregation is its own,
 independent topology.  If SE_FALSE, then all of the branches exist
 within the same topology.

strict_organizing_principle

 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: Oct Tree Related Features. Next: Overload Priority Index. Up:Index.