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! ❤️
Topology Of Adjacencies
It Computes the adjacency relationship among a list of polylines. Polylines do not need to have some points in common to match as adjacent cells; just the edges' alignment is essential. This component offerest three modes of computation with different overloads of computation complexity. It may only be sensible if with very complex networks.
Inputs
| Name | ID | Description | Type |
|---|---|---|---|
| Polylines | PL | The orthographic polylines on which this component will compute the topological adjacency | Curve |
| Method | M | The method of search: 0: Rectangular Polylines 1: Orthographic Polylines 2: Free Polylines | Integer |
| Tolerance | T | Searching distance | Number |
Outputs
| Name | ID | Description | Type |
|---|---|---|---|
| Cell→Cell | C→C | Cell→Cell Topology | Integer |
Site design © Robin Rodricks.
Heteroptera and associated data © 2024 Amin Bahrami (Helioripple Studio).
Rhinoceros and Grasshopper are registered trademarks of Robert McNeel & Associates.
Hosted by GitHub