Masterplan Clearance Engine

Calculates the shortest clearances between neighbouring tower outlines and categorises them by L1 and L2. Neighbour pairs come from a Delaunay triangulation (Method 0) or a proximity search (Method 1) of the outline bounding-box centres.

Masterplan Nickname: Clearance

Overview

Calculates topological (Delaunay) or proximity-based clearances between tower outlines with dynamic categorization.

Inputs (5)

  • Outlines (Curve): Outlines
  • SearchRadius (Number): Search Radius
  • Method (Integer): Method (0 = Delaunay, 1 = Proximity)
  • L1 (Number): Limit 1
  • L2 (Number): Limit 2

Outputs (5)

  • Distances (Number): Distances
  • Lines (Line): Lines
  • Categories (Integer): Categories
  • LabelPlanes (Plane): Label Planes
  • Info (Text): Method, assumptions, simplifications and references.

Method, assumptions and simplifications

The same notes appear in the component's Info output.

Method

  1. Each outline is represented by the centre of its bounding box.
  2. Method 0 (Delaunay): the centres are triangulated in plan (Grasshopper Delaunay, needs at least 3 outlines) and each triangle edge is a candidate neighbour pair.
  3. Method 1 (Proximity): pairs whose bounding boxes, grown by SearchRadius, overlap are candidates; a pair is skipped when any other centre lies closer to its mid-point than 0.85 × half the centre distance (a view-blocking test).
  4. For each pair the clearance is the shortest distance between the two curves (curve closest points); pairs farther than SearchRadius are dropped.
  5. Category = 0 if distance < L1, 1 if L1 <= distance <= L2, 2 if greater; LabelPlanes sit at the mid-point of each clearance line, rotated to read left to right; touching outlines (0 m clearance) get an unrotated World XY label plane.
  6. Each pair is listed once, in the branch of the first outline of the pair.

Assumptions

  • Outlines are closed plan curves at the same level; distances are 3D, so curves at different heights include the vertical offset.
  • Model units are metres (defaults SearchRadius 200, L1 50, L2 100).

Simplifications and limits

  • Neighbours are chosen from bounding-box centres, not true centroids or the outline shapes, so long or L-shaped towers can miss a near neighbour.
  • Overlapping or touching outlines give 0 m clearance; no check for containment.
  • With fewer than 3 outlines the Delaunay method returns nothing without a warning.

Workflow

  • Tower footprints -> Outlines. Lines and Categories -> custom preview or Analysis Dashboard; LabelPlanes and Distances -> text tags.

References

  • Delaunay B. (1934), Sur la sphère vide: Delaunay triangulation.