Computational Design — Digitteck Blog — Digitteck
Tag

Computational Design

5 articles

C# — Projecting a Point onto a Line by a Direction
altgorithms

C# — Projecting a Point onto a Line by a Direction

Finding the intersection of a directional ray from point C with line AB using parametric line equations — solving two simultaneous parametric equations for the parameter t on AB.

2018-10-13·3 min read
Dynamo Lists - Levelize List
dotnet

Dynamo Lists - Levelize List

A recursive IronPython custom node that makes two Dynamo lists structurally identical by filling length gaps with None, paired items, a fixed value, or the last seen item.

2018-05-29·4 min read
QuickHull - Divide and conquer
altgorithms

QuickHull - Divide and conquer

Implementing the QuickHull convex hull algorithm in IronPython for Dynamo — divide-and-conquer approach with Θ(n log n) average complexity, using cross-product point-side classification.

2018-04-22·5 min read
Parametric equation of circle and ellipse
altgorithms

Parametric equation of circle and ellipse

Applying the parametric equations of a circle and ellipse in Dynamo to generate computational geometry, including spirals, 3D forms, and heart shapes.

2018-04-15·2 min read
Sagitta
altgorithms

Sagitta

A computational design approach to the sagitta — the perpendicular height from a chord's midpoint to an arc — implemented as a reusable Dynamo custom node.

2018-04-15·1 min read
digitteck

© 2026 Digitteck