Nearest Curve (help)

Hello everyone,

I'm a student of Architecture and Urbanism in Brazil and I'm doing my final work using the grasshopper for analysis of urban density.

I wonder if there are any commands or commands that I can select curves next to other curves (I already tried to create points in the curve, but I only get a single point and I would like to select the whole curve).

Thank you for the help.

Isabella

Replies to This Discussion

Permalink Reply by Mikołaj Kierski on October 23, 2017 at 9:03am

hey Isabella, maybe you can try creating a list of the curves and then selecting specific items from that list corresponding to the curves that you want to select? don't really know what exactly is your case but this is just the loose idea that I had!

Permalink Reply by Isabella Eloy Cavalcanti on October 23, 2017 at 9:18am

Good idea! Thanks for the help Mikolaj but I'm using an urban area with blocks with different configurations, selecting curve by curve would have to be from an analysis of each block and the model would not make it genetic for any typology...I would need components to select the nearest curves :/

Permalink Reply by Mikołaj Kierski on October 23, 2017 at 9:24am

maybe you can create a cluster - you can create lines connecting the point on the base curve with the points on the neighbouring curves (e.g. by using CLX component) and then somehow compare their lengths and select the curve with the shortest length?

Permalink Reply by Isabella Eloy Cavalcanti on October 24, 2017 at 9:40am

Oh. I'll test soon I'll say if it worked !

Thanks again for the help.

Permalink Reply by peter fotiadis on October 23, 2017 at 11:39am

Well

1. Imagine "associating" each curve with the min distance (using the Curve.ClosestPoints Method) VS any other. Then you can write a K-Means clustering with regard the doubles and get the prox Curve collections since each double is related with a given Curve pair. The code captured below does that by accepting doubles or creates them (as Point to Point distance) and thus makes the required Clusters. Unfortunately is carried over solely via code.

2. On a much simplified level the following finds pairs of prox Curves. Also carried over solely via code.

Since you are asking about "commands" I assume that you are not familiar with coding.

Permalink Reply by Isabella Eloy Cavalcanti on October 24, 2017 at 9:42am

wow. Very interesting! I think it would be one solution, unfortunately , like you said, I'm not familiar with coding :/

Permalink Reply by peter fotiadis on October 24, 2017 at 10:26am

It's more or less the only solution. The K-Means approach is the classic one for "grouping" things based on average (mean) values: in case of Points values are due to Point to Point distances; in case of Curves values are due to Curve to Curve min distances ... in case of Breps values could be CoG to CoG distances ... etc etc etc.

RSS