Primitive = Compact Set + Precedence Graph

• Set of valid compacts

• No intersections

• Fills the primitive’s projected volume

Primitive

Compact set

Compact precedence graph

• Acyclic directed graph

• Link for every non-vertical adjacency

Previous slide

Next slide

Back to first slide

View graphic version