Hello,
So I’m trying partition this data tree using c# like the component “Partition List” does it grasshopper.
It’s giving me nightmarish solutions.
if anybody knows the answer , Help would be much appreciated.
thanks,
Youssef.
Your partition size is set to 8, and each of your resulting point lists has 8 points. That’s what partition does. What output are you looking for?
The list partition is doing it exactly the way I want to. I want to write it in c#. because this is plugin I’m making so I need to have this internally
If you want to write it yourself you’ll have to do some data tree management. This is a bit of a problem since data flowing through script components is pre-processed to get you the simplest data type. So inside a C# script component you always only get the Point3d data, not the GH_Point wrapper which may contain additional information which is lost when running that point through a script component.
However, the logic is something like this:
private void RunScript(DataTree<object> D, int S, ref object A)
{
var tree = new DataTree<object>();
for (int p = 0; p < D.BranchCount; p++)
{
var path = D.Path(p);
var list = D.Branch(p);
int index = 0;
int count = 0;
foreach (object val in list)
{
tree.Add(val, new GH_Path(p, index));
count++;
if (count >= S)
{
count = 0;
index++;
}
}
}
A = tree;
}
partition.gh (15.5 KB)
that’s exactly what I’m looking for !
it works fine in grasshopper scripting component. and you are right !
the info in the GH_Point wrapper used to make translate item to datatree is lost.
I can’t use this approach in visual studio.
is there another approach I can do other than changing all item containers to tree containers in my plugin ?
No, you have to use GH_Structure<IGH_Goo> instead of DataTree<object>, but the code will look very similar.
I studied GH_Structure<IGH_Goo> and used instead of tree. it didn’t partition the list.
It looks like this :
//partitioning sorted point data tree
GH_Structure<IGH_Goo> partitionedTree = new GH_Structure<IGH_Goo>();
for (int p = 0; p < sortedPoints.PathCount; p++)
{
var path = sortedPoints.get_Path( p );
var list = sortedPoints.get_Branch( p );
int index = 0;
int count = 0;
for(int q =0;q<list.Count;q++)
{
partitionedTree.Append(GH_Convert.ToGoo(list[q]), new GH_Path(p, index));
count++;
if (count>=8)
{
count = 0;
index++;
}
}
}
What does the partitionedTree look like after you’ve done this? The code looks correct.
It looks like this, it’s like I didn’t partition the list at all.
The code you you gave me works flawlessly on canvas.
You’re going to have to post all the code because I can’t see a mistake in what’s been posted so far but there could be a bug in the assignment.
Here you go
using System;
using System.Collections.Generic;
using System.Linq;
using Grasshopper;
using Grasshopper.Kernel;
using Grasshopper.Kernel.Data;
using Grasshopper.Kernel.Types;
using Rhino.Geometry;
using Rhino.Geometry.Intersect;
using SurfaceTrails2.Properties;
namespace SurfaceTrails2.Composite
{
public class Composite : GH_Component
{
public Composite()
: base("Composite Lines", "Composite",
"Creates YFA composite lines with respect to it's thickness",
"YFAtools", "Composite")
{
}
protected override void RegisterInputParams(GH_Component.GH_InputParamManager pManager)
{
pManager.AddBrepParameter("Brep", "b", "Brep to make the YFA composite system on", GH_ParamAccess.item);
pManager.AddNumberParameter("Naked edge length", "length", "Length of edge on the naked sides of the brep", GH_ParamAccess.item,0.05);
pManager.AddNumberParameter("Clothed edge width", "width", "width of edge on the clothed sides of the brep", GH_ParamAccess.item,0.01);
pManager.AddNumberParameter("Composite thickness", "Thickness", "Thickness of YFA composite", GH_ParamAccess.item,0.01);
pManager.AddNumberParameter("Nail radius", "Radius", "Nail radius of YFA composite", GH_ParamAccess.item,0.005);
}
protected override void RegisterOutputParams(GH_Component.GH_OutputParamManager pManager)
{
pManager.AddPointParameter("Composite points", "pt", "pt", GH_ParamAccess.tree);
pManager.AddCurveParameter("crv", "Composite curve", "crv", GH_ParamAccess.list);
pManager.AddCurveParameter("Nail circles", "circles", "Nail Location", GH_ParamAccess.tree);
pManager.AddPointParameter("Centermarks", "pt", "pt", GH_ParamAccess.tree);
pManager.AddCurveParameter("Centermark curves", "Centermark curves", "Center mark curves", GH_ParamAccess.tree);
pManager.AddCurveParameter("crv", "Brep Curve", "crv", GH_ParamAccess.item);
}
protected override void SolveInstance(IGH_DataAccess DA)
{
Brep brep = null;
double nakedLength = 0.05;
double clothedWidth = 0.01;
double thickness = 2;
double nailRadius = 0.005;
if (!DA.GetData(0, ref brep)) return;
if (!DA.GetData(1, ref nakedLength)) return;
if (!DA.GetData(2, ref clothedWidth)) return;
if (!DA.GetData(3, ref thickness)) return;
if (!DA.GetData(4, ref nailRadius)) return;
var intersectionPoints = new List<Point3d>();
var closedCurvePointsList = new List<Point3d>();
var interiorEdges = new List<Curve>();
var centroids = new List<Point3d>();
DataTree<Point3d> closestPoint = new DataTree<Point3d>();
List<Curve> curvesToSortAlong = new List<Curve>();
var sortedPoints = new DataTree<Point3d>();
List<Curve> compositeCurveTree = new List<Curve>();
var nailCircles = new DataTree<Circle>();
var centerMarkPoints = new DataTree<Point3d>();
var compositeCurveIntersectionSegments = new List<Curve>();
var centerMarkCurves = new DataTree<Curve>();
var nakedEdges = brep.DuplicateEdgeCurves(true);
var allCurvesEdges = brep.DuplicateEdgeCurves(false);
//getting interior edges
var allEdges = brep.Edges;
int l = 0;
foreach (BrepEdge brepEdge in allEdges)
{
if (brepEdge.Valence == EdgeAdjacency.Interior)
interiorEdges.Add(allCurvesEdges[l]);
l++;
}
//joinCurve
Curve[] border = Curve.JoinCurves(nakedEdges);
var borderCurve = border[0];
var offset1 = borderCurve.Offset(Plane.WorldXY, thickness, DocumentTolerance(), CurveOffsetCornerStyle.Sharp);
var offset2 = borderCurve.Offset(Plane.WorldXY, thickness * -1, DocumentTolerance(), CurveOffsetCornerStyle.Sharp);
//Minimum offset length
Curve offsetMin;
if (offset1.Length < offset2.Length)
offsetMin = offset1[0];
else
offsetMin = offset2[0];
//Interior curve & border intersection
for (int i = 0; i < interiorEdges.Count; i++)
{
CurveIntersections intersection = Intersection.CurveCurve(interiorEdges[i], offsetMin, DocumentTolerance(), DocumentTolerance());
for (int j = 0; j < intersection.Count; j++)
intersectionPoints.Add(intersection[j].PointA);
}
// Valence from brep edges
var allBrepOuterPoints = new List<Point3d>();
var dupPoints = new List<Point3d>();
var dupPointCount = new List<int>();
foreach (Curve allCurvesEdge in allCurvesEdges)
{
allBrepOuterPoints.Add(allCurvesEdge.PointAtStart);
allBrepOuterPoints.Add(allCurvesEdge.PointAtEnd);
}
foreach (Point3d brepPoint in allBrepOuterPoints)
{
bool exists = false;
for (int i = 0; i < dupPoints.Count; i++)
{
if (PointOperations.PointDifference(brepPoint, dupPoints[i]) < DocumentTolerance())
{
exists = true;
dupPointCount[i]++;
}
}
if (!exists)
{
dupPointCount.Add(1);
dupPoints.Add(brepPoint);
}
}
//getting brep corners
var brepCorners = new List<Point3d>();
for (int i = 0; i < dupPointCount.Count; i++)
if (dupPointCount[i] == 2)
brepCorners.Add(dupPoints[i]);
//projecting corners to offset curve
var offsetMinCorners = new List<Point3d>();
for (int i = 0; i < brepCorners.Count; i++)
{
double t;
offsetMin.ClosestPoint(brepCorners[i], out t);
offsetMinCorners.Add(offsetMin.PointAt(t));
}
//sorting all outer points along naked curve
var allBrepPoints = new List<Point3d>();
allBrepPoints.AddRange(offsetMinCorners);
allBrepPoints.AddRange(intersectionPoints);
//Outer brep lines
var sortedBrepPoints = PointOperations.SortAlongCurve(offsetMin, allBrepPoints);
var shiftedBrepPoints = ListOperations.Shift(sortedBrepPoints, 1);
var outerLines = new List<Polyline>();
var outerPoint1 = new List<Point3d>();
var outerPoint2 = new List<Point3d>();
//outer brep points
for (int i = 0; i < sortedBrepPoints.Count; i++)
{
var outerLine = new Polyline() {sortedBrepPoints[i], shiftedBrepPoints[i]};
outerPoint1.Add(outerLine.ToNurbsCurve().PointAtLength(outerLine.Length * 0.5 + nakedLength * 0.5));
outerPoint2.Add(outerLine.ToNurbsCurve().PointAtLength(outerLine.Length * 0.5 - nakedLength * 0.5));
outerLines.Add(outerLine);
}
//Inner segements & mid points
var innerSegments = new List<Polyline>();
var innerPoint1 = new List<Point3d>();
var innerPoint2 = new List<Point3d>();
for (int i = 0; i < interiorEdges.Count; i++)
{
var innerLine = new Polyline() {interiorEdges[i].PointAtStart, interiorEdges[i].PointAtEnd};
innerPoint1.Add(innerLine.ToNurbsCurve().PointAtLength(innerLine.Length * 0.5 + clothedWidth * 0.5));
innerPoint2.Add(innerLine.ToNurbsCurve().PointAtLength(innerLine.Length * 0.5 - clothedWidth * 0.5));
innerSegments.Add(innerLine);
}
//all point to list
closedCurvePointsList.AddRange(outerPoint1);
closedCurvePointsList.AddRange(outerPoint2);
closedCurvePointsList.AddRange(innerPoint1);
closedCurvePointsList.AddRange(innerPoint2);
//deconstruct brep to get faces, get centroids and get curves to sort along
foreach (BrepFace face in brep.Faces)
{
var faceBrep = face.DuplicateFace(true);
AreaMassProperties vmp = AreaMassProperties.Compute(faceBrep);
Point3d pt = vmp.Centroid;
centroids.Add(pt);
var faceBoundary = Curve.JoinCurves(faceBrep.DuplicateEdgeCurves());
curvesToSortAlong.Add(faceBoundary[0]);
}
//8 closest points to each centoid
int m = 0;
foreach (Point3d centroid in centroids)
{
GH_Path path = new GH_Path(m);
var closestPoints = PointOperations.ClosestPoints(centroid, closedCurvePointsList);
for (int n = 0; n < closestPoints.Count; n++)
closestPoint.Add(closestPoints[n], path);
m++;
}
//Sorting points along curves in a new datatree
for (int o = 0; o < curvesToSortAlong.Count; o++)
{
var branchToAdd = PointOperations.SortAlongCurve(curvesToSortAlong[o], closestPoint.Branch(o));
GH_Path path = new GH_Path(o);
sortedPoints.AddRange(branchToAdd, path);
}
//partitioning sorted point data tree
DataTree<object partitionedTree = new DataTree<object ();
for (int p = 0; p < sortedPoints.BranchCount; p++)
{
var path = sortedPoints.Path(p);
var list = sortedPoints.Branch(p);
int index = 0;
int count = 0;
for(int q =0;q<list.Count;q++)
{
partitionedTree.Add(list[q], new GH_Path(p, index));
count++;
if (count =8)
{
count = 0;
index++;
}
}
}
//Closed polyline to draw
for (int q = 0; q < sortedPoints.BranchCount; q++)
{
var compositeCurve = CurveOperations.ClosedPolylineFromPoints(sortedPoints.Branch(q));
compositeCurveTree.Add(compositeCurve);
}
//Drawing nails
for (int r = 0; r < sortedPoints.BranchCount; r++)
for (int s = 0; s < 8; s++)
{
Circle circle = new Circle(sortedPoints.Branch(r)[s], nailRadius);
GH_Path path = new GH_Path(r);
nailCircles.Add(circle, path);
}
//Edge centermark points
int u = 0;
foreach (Curve compositeCurve in compositeCurveTree)
{
var compositeCurveSegments = compositeCurve.DuplicateSegments();
compositeCurveIntersectionSegments =
CurveOperations.SortCurveByLength(compositeCurveSegments.ToList());
for (int t = 0; t < compositeCurveIntersectionSegments.Count; t++)
{
GH_Path path = new GH_Path(u);
var centerMarkPoint = compositeCurveIntersectionSegments[t].PointAtNormalizedLength(0.5);
centerMarkPoints.Add(centerMarkPoint, path);
var centerMarkPointx1 = new Point3d((centerMarkPoint.X + 0.005), centerMarkPoint.Y, centerMarkPoint.Z);
var centerMarkPointx2 = new Point3d((centerMarkPoint.X - 0.005), centerMarkPoint.Y, centerMarkPoint.Z);
var centerMarkPointy1 = new Point3d(centerMarkPoint.X, (centerMarkPoint.Y + 0.005), centerMarkPoint.Z);
var centerMarkPointy2 = new Point3d(centerMarkPoint.X, (centerMarkPoint.Y - 0.005), centerMarkPoint.Z);
var centerMarkCurve1 = new Line(centerMarkPointx1, centerMarkPointx2);
var centerMarkCurve2 = new Line(centerMarkPointy1, centerMarkPointy2);
centerMarkCurves.Add(centerMarkCurve1.ToNurbsCurve(), path);
centerMarkCurves.Add(centerMarkCurve2.ToNurbsCurve(), path);
//var centerMarkCurve1 = Line()
}
u++;
}
//Centermark cross
var c = partitionedTree;
var d = compositeCurveTree;
var e = nailCircles;
var f = centerMarkPoints;
var g = centerMarkCurves;
var h = offsetMin;
DA.SetDataTree(0, c);
DA.SetDataList(1, d);
DA.SetDataTree(2, e);
DA.SetDataTree(3, f);
DA.SetDataTree(4, g);
DA.SetData(5, h);
}
protected override System.Drawing.Bitmap Icon
{
get
{
return Resources._30_8_18_CompositeLines;
}
}
public override Guid ComponentGuid
{
get { return new Guid("3bd8113a-e9f6-4101-9d2b-e924d8d899c8"); }
}
}
}
I’m sorry, I edited your code and broke it because you had a > symbol in front of every line. This of course removed a whole bunch of important > symbols elsewhere.
You can put code blocks inside triple ticks to make them format correctly on discourse. I.e.
```
string code = “this looks better”;
```
yields.
string code = "this looks better";
Can you paste the actual code again in your previous reply in between the ticks?
Sure 
using System;
using System.Collections.Generic;
using System.Linq;
using Grasshopper;
using Grasshopper.Kernel;
using Grasshopper.Kernel.Data;
using Grasshopper.Kernel.Types;
using Rhino.Geometry;
using Rhino.Geometry.Intersect;
using SurfaceTrails2.Properties;
namespace SurfaceTrails2.Composite
{
public class Composite : GH_Component
{
/// <summary>
/// Initializes a new instance of the Composite class.
/// </summary>
public Composite()
: base("Composite Lines", "Composite",
"Creates YFA composite lines with respect to it's thickness",
"YFAtools", "Composite")
{
}
/// <summary>
/// Registers all the input parameters for this component.
/// </summary>
protected override void RegisterInputParams(GH_Component.GH_InputParamManager pManager)
{
pManager.AddBrepParameter("Brep", "b", "Brep to make the YFA composite system on", GH_ParamAccess.item);
pManager.AddNumberParameter("Naked edge length", "length", "Length of edge on the naked sides of the brep", GH_ParamAccess.item,0.05);
pManager.AddNumberParameter("Clothed edge width", "width", "width of edge on the clothed sides of the brep", GH_ParamAccess.item,0.01);
//pManager.AddNumberParameter("Center Mark", "Center", "Center Mark scale", GH_ParamAccess.item);
pManager.AddNumberParameter("Composite thickness", "Thickness", "Thickness of YFA composite", GH_ParamAccess.item,0.01);
pManager.AddNumberParameter("Nail radius", "Radius", "Nail radius of YFA composite", GH_ParamAccess.item,0.005);
}
/// <summary>
/// Registers all the output parameters for this component.
/// </summary>
protected override void RegisterOutputParams(GH_Component.GH_OutputParamManager pManager)
{
pManager.AddPointParameter("Composite points", "pt", "pt", GH_ParamAccess.tree);
pManager.AddCurveParameter("crv", "Composite curve", "crv", GH_ParamAccess.list);
pManager.AddCurveParameter("Nail circles", "circles", "Nail Location", GH_ParamAccess.tree);
pManager.AddPointParameter("Centermarks", "pt", "pt", GH_ParamAccess.tree);
pManager.AddCurveParameter("Centermark curves", "Centermark curves", "Center mark curves", GH_ParamAccess.tree);
pManager.AddCurveParameter("crv", "Brep Curve", "crv", GH_ParamAccess.item);
}
/// <summary>
/// This is the method that actually does the work.
/// </summary>
/// <param name="DA">The DA object is used to retrieve from inputs and store in outputs.</param>
protected override void SolveInstance(IGH_DataAccess DA)
{
//List<Brep> breps = new List<Brep>();
Brep brep = null;
double nakedLength = 0.05;
double clothedWidth = 0.01;
//double centerMark = 1;
double thickness = 2;
double nailRadius = 0.005;
if (!DA.GetData(0, ref brep)) return;
if (!DA.GetData(1, ref nakedLength)) return;
if (!DA.GetData(2, ref clothedWidth)) return;
//if (!DA.GetData(3, ref centerMark)) return;
if (!DA.GetData(3, ref thickness)) return;
if (!DA.GetData(4, ref nailRadius)) return;
var intersectionPoints = new List<Point3d>();
var closedCurvePointsList = new List<Point3d>();
var interiorEdges = new List<Curve>();
var centroids = new List<Point3d>();
DataTree<Point3d> closestPoint = new DataTree<Point3d>();
List<Curve> curvesToSortAlong = new List<Curve>();
var sortedPoints = new DataTree<Point3d>();
List<Curve> compositeCurveTree = new List<Curve>();
var nailCircles = new DataTree<Circle>();
var centerMarkPoints = new DataTree<Point3d>();
var compositeCurveIntersectionSegments = new List<Curve>();
var centerMarkCurves = new DataTree<Curve>();
var nakedEdges = brep.DuplicateEdgeCurves(true);
var allCurvesEdges = brep.DuplicateEdgeCurves(false);
//getting interior edges
var allEdges = brep.Edges;
int l = 0;
foreach (BrepEdge brepEdge in allEdges)
{
if (brepEdge.Valence == EdgeAdjacency.Interior)
interiorEdges.Add(allCurvesEdges[l]);
l++;
}
//joinCurve
Curve[] border = Curve.JoinCurves(nakedEdges);
var borderCurve = border[0];
var offset1 = borderCurve.Offset(Plane.WorldXY, thickness, DocumentTolerance(),
CurveOffsetCornerStyle.Sharp);
var offset2 = borderCurve.Offset(Plane.WorldXY, thickness * -1, DocumentTolerance(),
CurveOffsetCornerStyle.Sharp);
//Minimum offset length
Curve offsetMin;
if (offset1.Length < offset2.Length)
offsetMin = offset1[0];
else
offsetMin = offset2[0];
//Interior curve & border intersection
for (int i = 0; i < interiorEdges.Count; i++)
{
CurveIntersections intersection = Intersection.CurveCurve(interiorEdges[i], offsetMin,
DocumentTolerance(), DocumentTolerance());
for (int j = 0; j < intersection.Count; j++)
{
intersectionPoints.Add(intersection[j].PointA);
}
}
// Valence from brep edges
var allBrepOuterPoints = new List<Point3d>();
var dupPoints = new List<Point3d>();
var dupPointCount = new List<int>();
foreach (Curve allCurvesEdge in allCurvesEdges)
{
allBrepOuterPoints.Add(allCurvesEdge.PointAtStart);
allBrepOuterPoints.Add(allCurvesEdge.PointAtEnd);
}
foreach (Point3d brepPoint in allBrepOuterPoints)
{
bool exists = false;
for (int i = 0; i < dupPoints.Count; i++)
{
if (PointOperations.PointDifference(brepPoint, dupPoints[i]) < DocumentTolerance())
{
exists = true;
dupPointCount[i]++;
}
}
if (!exists)
{
dupPointCount.Add(1);
dupPoints.Add(brepPoint);
}
}
//getting brep corners
var brepCorners = new List<Point3d>();
for (int i = 0; i < dupPointCount.Count; i++)
{
if (dupPointCount[i] == 2)
{
brepCorners.Add(dupPoints[i]);
}
}
//projecting corners to offset curve
var offsetMinCorners = new List<Point3d>();
for (int i = 0; i < brepCorners.Count; i++)
{
double t;
offsetMin.ClosestPoint(brepCorners[i], out t);
offsetMinCorners.Add(offsetMin.PointAt(t));
}
//sorting all outer points along naked curve
var allBrepPoints = new List<Point3d>();
allBrepPoints.AddRange(offsetMinCorners);
allBrepPoints.AddRange(intersectionPoints);
//Outer brep lines
var sortedBrepPoints = PointOperations.SortAlongCurve(offsetMin, allBrepPoints);
var shiftedBrepPoints = ListOperations.Shift(sortedBrepPoints, 1);
var outerLines = new List<Polyline>();
var outerPoint1 = new List<Point3d>();
var outerPoint2 = new List<Point3d>();
//outer brep points
for (int i = 0; i < sortedBrepPoints.Count; i++)
{
var outerLine = new Polyline() {sortedBrepPoints[i], shiftedBrepPoints[i]};
outerPoint1.Add(outerLine.ToNurbsCurve().PointAtLength(outerLine.Length * 0.5 + nakedLength * 0.5));
outerPoint2.Add(outerLine.ToNurbsCurve().PointAtLength(outerLine.Length * 0.5 - nakedLength * 0.5));
outerLines.Add(outerLine);
}
//Inner segements & mid points
var innerSegments = new List<Polyline>();
var innerPoint1 = new List<Point3d>();
var innerPoint2 = new List<Point3d>();
for (int i = 0; i < interiorEdges.Count; i++)
{
var innerLine = new Polyline() {interiorEdges[i].PointAtStart, interiorEdges[i].PointAtEnd};
innerPoint1.Add(innerLine.ToNurbsCurve().PointAtLength(innerLine.Length * 0.5 + clothedWidth * 0.5));
innerPoint2.Add(innerLine.ToNurbsCurve().PointAtLength(innerLine.Length * 0.5 - clothedWidth * 0.5));
innerSegments.Add(innerLine);
}
//all point to list
closedCurvePointsList.AddRange(outerPoint1);
closedCurvePointsList.AddRange(outerPoint2);
closedCurvePointsList.AddRange(innerPoint1);
closedCurvePointsList.AddRange(innerPoint2);
//deconstruct brep to get faces, get centroids and get curves to sort along
foreach (BrepFace face in brep.Faces)
{
var faceBrep = face.DuplicateFace(true);
AreaMassProperties vmp = AreaMassProperties.Compute(faceBrep);
Point3d pt = vmp.Centroid;
centroids.Add(pt);
var faceBoundary = Curve.JoinCurves(faceBrep.DuplicateEdgeCurves());
curvesToSortAlong.Add(faceBoundary[0]);
}
//8 closest points to each centoid
int m = 0;
foreach (Point3d centroid in centroids)
{
GH_Path path = new GH_Path(m);
var closestPoints = PointOperations.ClosestPoints(centroid, closedCurvePointsList);
for (int n = 0; n < closestPoints.Count; n++)
closestPoint.Add(closestPoints[n], path);
m++;
}
//Sorting points along curves in a new datatree
for (int o = 0; o < curvesToSortAlong.Count; o++)
{
var branchToAdd = PointOperations.SortAlongCurve(curvesToSortAlong[o], closestPoint.Branch(o));
GH_Path path = new GH_Path(o);
sortedPoints.AddRange(branchToAdd, path);
}
//partitioning sorted point data tree
DataTree<object> partitionedTree = new DataTree<object>();
for (int p = 0; p < sortedPoints.BranchCount; p++)
{
var path = sortedPoints.Path(p);
var list = sortedPoints.Branch(p);
int index = 0;
int count = 0;
for(int q =0;q<list.Count;q++)
{
partitionedTree.Add(list[q], new GH_Path(p, index));
count++;
if (count>=8)
{
count = 0;
index++;
}
}
}
//var dividedSortedPointed = new DataTree<Point3d>();
// for(int i=0; i < sortedPoints.)
//Closed polyline to draw
for (int q = 0; q < sortedPoints.BranchCount; q++)
{
var compositeCurve = CurveOperations.ClosedPolylineFromPoints(sortedPoints.Branch(q));
compositeCurveTree.Add(compositeCurve);
}
//Drawing nails
for (int r = 0; r < sortedPoints.BranchCount; r++)
{
for (int s = 0; s < 8; s++)
{
Circle circle = new Circle(sortedPoints.Branch(r)[s], nailRadius);
GH_Path path = new GH_Path(r);
nailCircles.Add(circle, path);
}
}
//Edge centermark points
int u = 0;
foreach (Curve compositeCurve in compositeCurveTree)
{
var compositeCurveSegments = compositeCurve.DuplicateSegments();
compositeCurveIntersectionSegments =
CurveOperations.SortCurveByLength(compositeCurveSegments.ToList());
for (int t = 0; t < compositeCurveIntersectionSegments.Count; t++)
{
GH_Path path = new GH_Path(u);
var centerMarkPoint = compositeCurveIntersectionSegments[t].PointAtNormalizedLength(0.5);
centerMarkPoints.Add(centerMarkPoint, path);
var centerMarkPointx1 = new Point3d((centerMarkPoint.X + 0.005), centerMarkPoint.Y,
centerMarkPoint.Z);
var centerMarkPointx2 = new Point3d((centerMarkPoint.X - 0.005), centerMarkPoint.Y,
centerMarkPoint.Z);
var centerMarkPointy1 = new Point3d(centerMarkPoint.X, (centerMarkPoint.Y + 0.005),
centerMarkPoint.Z);
var centerMarkPointy2 = new Point3d(centerMarkPoint.X, (centerMarkPoint.Y - 0.005),
centerMarkPoint.Z);
var centerMarkCurve1 = new Line(centerMarkPointx1, centerMarkPointx2);
var centerMarkCurve2 = new Line(centerMarkPointy1, centerMarkPointy2);
centerMarkCurves.Add(centerMarkCurve1.ToNurbsCurve(), path);
centerMarkCurves.Add(centerMarkCurve2.ToNurbsCurve(), path);
//var centerMarkCurve1 = Line()
}
u++;
}
//Centermark cross
var c = partitionedTree;
var d = compositeCurveTree;
var e = nailCircles;
var f = centerMarkPoints;
var g = centerMarkCurves;
var h = offsetMin;
DA.SetDataTree(0, c);
DA.SetDataList(1, d);
DA.SetDataTree(2, e);
DA.SetDataTree(3, f);
DA.SetDataTree(4, g);
DA.SetData(5, h);
}
/// <summary>
/// Provides an Icon for the component.
/// </summary>
protected override System.Drawing.Bitmap Icon
{
get
{
//You can add image files to your project resources and access them like this:
// return Resources.IconForThisComponent;
return Resources._30_8_18_CompositeLines;
}
}
/// <summary>
/// Gets the unique ID for this component. Do not change this ID after release.
/// </summary>
public override Guid ComponentGuid
{
get { return new Guid("3bd8113a-e9f6-4101-9d2b-e924d8d899c8"); }
}
}
}
There was a lot going on there, and also reliable on PointTools and CurveTools classes which were not included.
I did notice you’re still using DataTree everywhere rather than GH_Structure. Technically allowed, but I’d recommend against it when developing on Visual Studio.
Here’s a component which partitions a tree into chunks of eight, and only that.
using System;
using Grasshopper.Kernel;
using Grasshopper.Kernel.Data;
using Grasshopper.Kernel.Types;
namespace SurfaceTrails2.Composite
{
public class Composite : GH_Component
{
public Composite()
: base("Partition test", "PartTest", "Test partitioning logic.", "YFAtools", "Composite")
{ }
protected override void RegisterInputParams(GH_InputParamManager pManager)
{
pManager.AddGenericParameter("Data", "D", "Generic data", GH_ParamAccess.tree);
}
protected override void RegisterOutputParams(GH_OutputParamManager pManager)
{
pManager.AddGenericParameter("Partitioned data", "P", "Partitioned data into chunks of 8.", GH_ParamAccess.tree);
}
protected override void SolveInstance(IGH_DataAccess access)
{
access.GetDataTree(0, out GH_Structure<IGH_Goo> tree);
var partitioned = new GH_Structure<IGH_Goo>();
if (tree != null && !tree.IsEmpty)
{
for (int p = 0; p < tree.PathCount; p++)
{
var path = tree.Paths[p];
var list = tree.Branches[p];
int index = 0;
int count = 0;
for (int i = 0; i < list.Count; i++)
{
partitioned.Append(list[i], path.AppendElement(index));
count++;
if (count >= 8)
{
count = 0;
index++;
}
}
}
}
access.SetDataTree(0, partitioned);
}
protected override System.Drawing.Bitmap Icon
{
get { return null; }
}
public override Guid ComponentGuid
{
get { return new Guid("{5DBD9E06-4ACB-44E3-BEB6-46D52124EB95}"); }
}
}
}