We need your help! 🔥
Please consider disabling your ad-blocker to support this website! 🔑
We are a free, community-supported website! 🥰
We only display small unobtrusive ads which help us stay online! 💯
Thank you in advance! ❤️
We are a free, community-supported website! 🥰
We only display small unobtrusive ads which help us stay online! 💯
Thank you in advance! ❤️
Geodesics Point To Point
Calculate multiple geodesics from a point to another point. This algorithm stops at naked edges
Inputs
| Name | ID | Description | Type |
|---|---|---|---|
| Mesh | M | Mesh | Mesh |
| Point From | Pfrom | Departure point | Point |
| Point To | Pto | Arrival point | Point |
| SmoothMesh | S | Tell if angle is from smooth mesh or face normal | Boolean |
| Divisions | D | Number of initials paths on a fan of 360° [8, 1000] | Integer |
| Iterations | N | Maximum number of iterations [0,100] | Integer |
| MiddleAngle | M | If true next path is at middle angle of a fan | Boolean |
| Tolerance | T | Tolerance [1e-8, x] | Number |
Outputs
| Name | ID | Description | Type |
|---|---|---|---|
| Path | P | Minimum length geodesic | Curve |
| Length | L | Geodesic minimum path length | Number |
| Paths | Ps | Geodesics | Curve |
Site design © Robin Rodricks.
Nautilus and associated data © 2024 Laurent Delrieu.
Rhinoceros and Grasshopper are registered trademarks of Robert McNeel & Associates.
Hosted by GitHub