Link
Search
Menu
Expand
Document
PCG Extended Toolkit
∷ Installation
∷ General
Basics
Plugin Settings
PCGEx Nodes
Working with Clusters
Comparisons
Blending
Fitting
Filter Ecosystem
Uber Filter
Uber Filter (Collection)
🝖 AND / OR (Group)
🝖 Compare Nearest (Numeric)
🝖 Compare (Numeric)
🝖 Compare (String)
🝖 Bool
🝖 Dot Product
🝖 Within Range
🝖 Modulo Comparison
🝖 Bounds
🝖 Bitmask
🝖 Random
🝖 Mean Value
🝖 Self Compare (Numeric)
🝖 Self Compare (String)
🝖 Spline Inclusion
🝖 Path Inclusion
Clusters
Connect Points
🝆 Index
🝆 Direction
🝆 Closest
🝆 Anisotropic
Diagrams
Delaunay 2D
Voronoi 2D
Delaunay 3D
Voronoi 3D
Fuse Clusters
Refine
🝔 Minimum Spanning Tree
🝔 Refine by Filter
🝔 Line Trace
🝔 Gabriel
🝔 Remove Overlap
🝔 Keep Highest Score
🝔 Keep Lowest Score
🝔 Remove Highest Score
🝔 Remove Lowest Score
🝔 Keep Longest
🝔 Keep Shortest
🝔 Remove Longest
🝔 Remove Shortest
Mesh to Clusters
Properties : Edge
Properties : Vtx
🝊 Special Neighbors
🝊 Special Edges
🝊 Edge Match
Flag Nodes
Node Flag
Hulls
Convex Hull 3D
Convex Hull 2D
Cut Clusters
Copy Cluster to Points
Sanitize Clusters
Pick Closest Cluster
Relax
☍ Laplacian
☍ Force Directed
Find Clusters
Partition Vertices
Break to Paths
Make Unique
Find point on Bounds
Connect Clusters
Custom Graph
Packing Clusters
Pack Clusters
Unpack Clusters
Cluster Filters
🝖 Adjacency (Node)
🝖 Edge Direction (Node)
🝖 Neighbors Count (Node)
🝖 Edge Direction (Edge)
🝖 Endpoints Compare (Numeric)
🝖 Endpoints Compare (String)
🝖 Neighbors Count (Edge)
Pathfinding
Edges Pathfinding
Plot Edges Pathfinding
Find Contours
Grow Paths
⊚ Search
A* Star
Dijkstra
🝰 Heuristics
🝰 Heuristic Attribute
🝰 Shortest Distance
🝰 Azimuth
🝰 Feedback
🝰 Inertia
🝰 Steepness
🝰 Least Nodes
🝓 Goal Pickers
🝓 Goal from Attribute
🝓 Default
🝓 Random
Paths
Smooth
Moving Average
Radius
Path × Path Crossings
Solidify Path
Path Spline Mesh
Blend
⋰ Interpolate
⋰ Inherit First
⋰ Inherit Last
Orient
⋋ Average
⋋ Look At
⋋ Weighted
Path × Bounds Intersections
Fuse Collinear
Resample
Shift
Path Spline Mesh (Simple)
Spline to Path
Bevel
Attribute Rolling
Offset
Write Paths Properties
Subdivide
Create Spline
Write Tangents
∢ Auto Tangents
∢ Catmull-Rom
∢ From Neighbors
∢ From Transform
∢ Zero Tangents
Paths to Clusters
Staging
Asset Staging
Asset Collection to Set
Asset Collection
🝱 Mesh Collection
🝱 Actor Collection
Misc
Sort Points
🝘 Sorting Rule
Partition by Values
🝗 Partition Rule
Fuse Points
Find point on Bounds (Any)
Points to Bounds
Attribute Stats
Merge Points by Tags
Meta Cleanup
Collocation Count
Cherry Pick Points
Conditional Actions
🝐 Write Attributes
🝐 Write Result
Write Index
Meta Filter
Reverse Points Order
Refresh Seed
Bitmasks
Bitmask
Bitmask Merge
Discard by Points Count
Discard by Overlap
Transforms
Move Pivot
Bounds to Points
Flat Projection
Lloyd Relax
2D Lloyd Relaxation
3D Lloyd Relaxation
Debug
Flush Debug
Draw Attributes
Sampling
Sample Nearest Surface
Sample Line Trace
Sample Nearest Spline
Sample Nearest Bounds
Sample Overlap Stats
Sample Nearest Points
Sample Neighbors
Pack Actor Data
Sample Inside Bounds
Shape Ecosystem
Create Shapes
🜛 Circle
All Nodes
About
Twitter
LinkedIn
Pathfinding
⊚ Search
Dijkstra
Dijkstra
Dijkstra’s Algorithm
Dijkstra’s Algorithm
implementation.
Dijkstra on Wikipedia