compute an approximate minimal surface without recursion ("in one shot")
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
Properties
ReleasedBinaries
Resources
.gitignore
AnnularLaplaceData.cs
LaplaceData.cs
MinSurfaceComponent.cs
MinSurfaceComponentOneBoundaryComponent.cs
MinSurfaceInfo.cs
MinSurfacev6.csproj
MinSurfacev6.sln
README.md
minm.jpg
simpleSmoothSaddle.3dm

README.md

MinimalSurface

compute an approximate minimal surface without recursion ("in one shot")

minm

This grasshopper component is just another minimal surface solver. However, unlike most minimal surface solvers, it is not based on physical or iterative principles. Instead, it computes three harmonic functions of the (u, v) coordinates. This yields an approximation because minimal surfaces enjoy the property that their three coordinate functions on the surface itself are harmonic.

Thus, we end up with an approximation. The approximation is perfect once the (u, v)-patch is isothermal.

Binary releases

Get your binary gha file here