Module

DataViz.Layout.Hierarchy.Pack

Package: purescript-hylograph-layout
Repository: afcondon/purescript-hylograph-layout

Circle packing layout algorithm.

Implements the front-chain circle packing algorithm for laying out hierarchical data as nested circles. Each node's area is proportional to its value, with children packed inside their parent's circle.

The algorithm:

Build hierarchy from input data with hierarchy
Pack sibling circles using packSiblingsMap (front-chain algorithm)
Compute enclosing circle with packEnclose
Recursively pack all levels with pack

Based on Wang et al.'s "Visualization of Large Hierarchical Data by Circle Packing" and the D3.js implementation.

#CircleId Source

type CircleId = Int

Circle ID for map-based storage

#Circle Source

type Circle = { r :: Number, x :: Number, y :: Number }

Circle type for geometric operations

#PackState Source

type PackState = { circles :: Map CircleId Circle, frontChain :: Array CircleId, nextId :: CircleId }

State for map-based pack algorithm

#epsilon Source

epsilon :: Number

#epsilon6 Source

epsilon6 :: Number

#enclosesWeak Source

enclosesWeak :: Circle -> Circle -> Boolean

Does circle a enclose circle b (with tolerance)?

#intersects Source

intersects :: Circle -> Circle -> Boolean

Do circles a and b intersect?

#place Source

place :: Circle -> Circle -> Circle -> Circle

Position circle c tangent to circles a and b

#packSiblingsMap Source

packSiblingsMap :: Array Circle -> { circles :: Array Circle, radius :: Number }

Pack siblings using map-based front-chain algorithm

#packEnclose Source

packEnclose :: Array Circle -> Circle

#PackNode Source

data PackNode a

Pack node extends hierarchy with circle coordinates

Constructors

PackNode { children :: Array (PackNode a), data_ :: a, depth :: Int, height :: Int, r :: Number, value :: Number, x :: Number, y :: Number }

Instances

(Eq a) => Eq (PackNode a)
(Ord a) => Ord (PackNode a)
(Show a) => Show (PackNode a)

#PackConfig Source

type PackConfig a = { padding :: Number, radius :: Maybe (a -> Number), size :: { height :: Number, width :: Number } }

Configuration for pack layout

#defaultPackConfig Source

defaultPackConfig :: forall a. PackConfig a

Default pack configuration

#HierarchyData Source

newtype HierarchyData a

Simple hierarchy node for testing

Constructors

HierarchyData { children :: Maybe (Array (HierarchyData a)), data_ :: a, value :: Maybe Number }

#hierarchy Source

hierarchy :: forall a. HierarchyData a -> PackNode a

Create a hierarchy from data

#pack Source

pack :: forall a. PackConfig a -> PackNode a -> PackNode a

Apply pack layout to a hierarchy using the map-based algorithm Implements D3's two-pass algorithm for proper padding

Modules: DataViz.Layout.Adjacency; DataViz.Layout.Adjacency.Layout; DataViz.Layout.Adjacency.Types; DataViz.Layout.Chord; DataViz.Layout.Chord.Layout; DataViz.Layout.Chord.Types; DataViz.Layout.Hierarchy.Cluster; DataViz.Layout.Hierarchy.Core; DataViz.Layout.Hierarchy.EdgeBundle; DataViz.Layout.Hierarchy.EdgeBundle.Bilink; DataViz.Layout.Hierarchy.EdgeBundle.BundleCurve; DataViz.Layout.Hierarchy.EdgeBundle.Hierarchy; DataViz.Layout.Hierarchy.EdgeBundle.RadialCluster; DataViz.Layout.Hierarchy.EdgeBundle.Types; DataViz.Layout.Hierarchy.Link; DataViz.Layout.Hierarchy.Pack; DataViz.Layout.Hierarchy.Partition; DataViz.Layout.Hierarchy.Tree; DataViz.Layout.Hierarchy.TreeStyle; DataViz.Layout.Hierarchy.Treemap; DataViz.Layout.Hierarchy.Types; DataViz.Layout.Pattern; DataViz.Layout.Pattern.Types; DataViz.Layout.Sankey.CSV; DataViz.Layout.Sankey.Compute; DataViz.Layout.Sankey.ComputeWithSteps; DataViz.Layout.Sankey.Path; DataViz.Layout.Sankey.Types; DataViz.Layout.StateMachine; DataViz.Layout.StateMachine.Layout; DataViz.Layout.StateMachine.Path; DataViz.Layout.StateMachine.Types