0.7.6 - Beta

Intralattice is still in the early stages of development. Things may break without warning.
For more information, go to http://intralattice.com

Changes

• Meshing
  • Fixed major issue with the HeterogenCustom component.
• Unit Cells
  • Added 3 new unit cells (diamond, honeycomb 1 and honeycomb 2).
  • Loosened requirements for custom unit cells.
  • PresetCell now has an extra line output, to allow user to modify the preset cell topologies.

0.7.5 - Beta

Intralattice is still in the early stages of development. Things may break without warning.
For more information, go to http://intralattice.com

Changes

• General
  • Added icons.
  • Added AdjustUV and CleanNetwork components.
  • HeterogenGradient now takes gradient functions g(x,y,z) as input. (math expression string)
  • Major cleanup of code and comments.
  • Various bug fixes.
• Meshing
  • Now supports curve networks.
  • Plate offset computation improved - robust incremental approach.
• Data Structure
  • New objects: UnitCell, Lattice, ExoMesh
  • Complete revamp of class structure and method encapsulation.
  • GH_Goo wrapper for the UnitCell class.

0.7.4

Intralattice is still in the early stages of development. Things may break without warning.
For more information, go to http://intralattice.com

Changes

• Data Structure
  • Instances of GH_Structure replaced with DataTree, which does not require IGH_Goo. This is of little relevance to users.
• Conformal Morphing
  • New morphing algorithm (Space Morphing) which discretizes linear struts and maps them to the uvw space as interpolated curves. This method is much more robust than the Bezier method. Nonetheless, the latter is still included.
• General
  • Major cleanup of code and comments.

0.7.3

This is the first release of the new C# version of Intralattice.
It is still in the early stages of development. Things may break without warning.
For more information, go to http://intralattice.com

Changes

• Data structure improvements
  • UnitCell object and associated methods ensure validity and allow for quick formatting the cell topologies.
  • Revamped cell mapping algorithms, using a data tree to store map cells (u,v,w) and their nodes (i), as a full tree path (u,v,w,i). This approach greatly simplifies the process of defining adjacencies, and avoiding the creation of duplicate struts or nodes.
• Conformal Morphing
  • Use directional surface derivatives to morph linear struts to bezier curves.
  • Will likely be improved in the near future.
• Meshing
  • Heterogeneous gradient is now math-based, accepting inputs like 'x+y/2'