The Giraffe Parking Lots algorithm is a powerful tool for visualizing and designing parking areas. Sometimes it's necessary to solve parking spaces relative to a building position. This guide will show you how.
Draw a feature and apply the Carpark usage.
Draw another feature using a Building Section usage (this example uses Retail)
Add the carpark transform to the Carpark geometry
Click the geometry
Open the Flow Manage and click "quick transformation.
Select “Parking Bays”
Add the Boolean Difference node between Read Feature and Parking Lot
Add get raw features
The goal is to subtract everything that is not a carpark from the carpark geometry.
Get Raw Features will retrieve all of the geometries in the project.
Therefore, we need to filter out the Carpark geometry from the list of Raw features
Add Filter
In this example, we are filtering by the usage Carpark.
Add read feature property and input “usage” into the box.
Add not equals and add get usage, then select carpark from the list.
Connect the results of Not Equals back into the filter
Connect the Match (M[]) list from Filter to the B[] list of boolean difference
The resulting flow looks like this:
And it solves parking bays around any overlapping geometries that are not the Carpark usage
