Hi all, I’m attempting to create a sort of ‘Curve In Curve’ operation. My approach however is not particularly efficient as it relies on an Area calc and ‘Point In Curves’ method. [Curve%20In%20Curve] The Problem: I have several thousand (200K+) closed polylines some of which contain smaller pol…

Math.Pow(hmm,hmm) … that’s for the P thingy (what about the Truth Out There ?, he he) This thread started as any other thread and heads towards other things I confess. Must clear my mind from doing Panigale custom maps (a useless thing considering the ponies available as standard) and fucus to the…

[image] qythium: using an RTree [image] qythium: using Python Great example there, bookmarked :clap:

Another improvement in special case when we know that curves do not intersect will be to check if curveB.PointAtStart is inside curveA. Code inside tree.Search would look like: tree.Search(bboxA, (to, ta) => { int j = ta.Id; if (i != ta.Id && !sampled[j]) { Curve crvB = cLi…

[image] RadovanG: Another improvement It’s a question of trust the data (as always). But other than that I see that you are a man who walks the walk (as Gythium … if we forget that little detail, he he) > bravo again. Clusters_CurveContainment_V2B.gh (341.3 KB) BTW: It’s funny that even a p…

You know what? In fact we don’t need a RTree at all. Just BBoxes and some canditate BBox questions (but that is what a RTree does anyway [pluts the fact that does N*N comparisons]). Rounding the BBox domains (user controlled option: say in 2 decimals etc helps as well). See : Mesh Inclusion Error a…

This entire thread: [3557d382-5035-41ee-b836-9ab6c666fc56-EscalatedQuicklyThumb]

I tried some boxMagic things and with help of mice sudenly I got some code that is permormig well. Litle bit of some sortings, up-sortings, right-sorting… re-sortings and rememberings what I was just sorting … with assumption that curveA contains curveB only and only if bboxA contains bboxA what s…

Indeed the magic this (and magic that) can cut the mustard rather well. Me? Well … Valentino finished a miserable 4th in Texas (IM miles behind that man, even Iannone got a podium place) meaning that I have absolutely no will for C,D,E … Z# : In fact if I was a real man I should commit seppuku ASAP…

Hi, I was wondering what would be the test condition for the case when the edge of an Inner-Curve overlaps with the edge of the Outer-Curve. Something like this: [Curves%20Overlap] In this case the result should give: A{1,3}, B{0,3,4}, C{0,2}.

[image] RadovanG: image: PolyLine_Inside_PolyLine.png1538x743 37.6 KB If we consider special case C. then algorithm will be valid for any curve, not only polylines. Interesting, especially A which seems to be a typical Minkowski Sum problem in which A can be numerically solved in almost…

A better approach replicating 'Curves in Curves'

Grasshopper

Michael_Pryor (ekim) April 23, 2018, 12:23am 28

This entire thread:

3 Likes

Topic		Replies	Views
Curve.Contains Method too slow Rhino Developer v6 , v5	67	5518	February 18, 2022
Maximise non-overlapping curves from set of overlapping curves Grasshopper Developer	17	956	January 16, 2020
Boundary/Outline "Contest" GH/C# Grasshopper rhinocommon	39	2977	July 7, 2019
Find curves that are contained within another curve Scripting windows	17	187	January 9, 2026
Sort Curves Grasshopper	26	8291	March 1, 2018

A better approach replicating 'Curves in Curves'

Related topics