pearswj / buckminster Goto Github PK

Mesh a surface by tracing lines through principal direction vector field.

See Dual Streamline Seeding - Method and Implementation.

Hello, under what license is this project released under ? Thank-you.

Wants

• Molecular parameter to allow creation of non-manifold ground-structures in Grasshopper.
• User able to set tensile/compressive capacity and joint cost.
• User specification of PCL (Potential Connections List)...
• Proximity lacing/gridding (with possibility to specify closed surfaces denoting "no-go zones").

Ideas

• If proximity is essentially a limit on the maximum length of members, how about setting a minimum length too?
• Further constraints on the ground-structure to improve build-ability...

Add user options:

• starting point
• rotation angle of axis curves

See Chebychev Nets for implementation details.

Apply Sheffield's TopOpt to a ground-structure created by lacing meshes #9.

See OperatorsRibbon and OperatorsExtrude.

Rhino's built-in mesh implementation is restricted to triangle/quad meshes. A custom data type is required to allow generation of n-gon meshes (i.e. faces with more than four sides).

• Decide on a data structure – Halfedge
• Write class and Euler operators
• Wrap with GH_Goo or GH_GeometryGoo
• Implement CastTo for Grasshopper mesh type

References

• Polygon mesh
• Halfedge

How normally naked edges are computed for chebyshev nets?

Are the last segments extended somehow?

And the part at the corners after 45 degree rotation, when segments do not reach corner.
Why this happens?

Needs more robust method to define the points along the axes. (See method used for infill.)

See Paul Richen's Processing sketch, conway2, for ideas.

Generate 6-valent tri mesh from surface using circle-/sphere-packing.

Interesting implications when Conway operators are subsequently applied (dual and ambo in particular).

Rather than creating a 'lookup dictionary' for each operation, mesh elements (vertices, faces, halfedges should store their index.

This requires special attention during any Add/Remove procedures.

Hi,

I saw the implementation of Chebyshev net in C# from:
http://graphicon.ru/html/2002/pdf/Popov_En_Re.pdf
on:
https://vimeo.com/71686437

Is the code available or possible to try?:)

• adding a new face (from a CCW list of vertices)
• matching up pairs of halfedges (given a list of halfedges)
• gettin a list of unique edges

Loop and Catmull-Clark. Must be fast.

Implement a whole bunch of mesh operators, as defined by John Conway.

Get Dual, Ambo and Kis done first -- many others can be derived from combinations of these three.

A (by no means exhaustive) list:

• Dual
• Ambo
• Kis
• Join
• Truncate
• Bitruncate
• Expand
• Ortho

See StiffnessMethod.

Rhino mesh to PolyMesh and TopOpt solver seem to be playing up when called in the test framework, but everything else should be covered!!