Skip to content

Releases: AdvancedPhotonSource/xdesign

v0.6.0

v0.6.0 Pre-release
Pre-release

Choose a tag to compare

@carterbox carterbox released this 13 Jul 22:14
12fc1a2

What's Changed

Full Changelog: v0.5.5...v0.6.0

v0.5.5

v0.5.5 Pre-release
Pre-release

Choose a tag to compare

@carterbox carterbox released this 14 Jan 21:02
778914c

What's Changed

New Contributors

Full Changelog: v0.5.4...v0.5.5

API Change and polygon intersections

Pre-release

Choose a tag to compare

@carterbox carterbox released this 16 Aug 22:14
8bc68ce
  • Major API change for probe.measure; now uses theta, h, v coordiantes
  • Replace polytope with deterministic intersection calculations
  • Change coverage glyphs to pie glyphs
  • Moves tests from 3.4 to 3.6

Coverage Maps

Coverage Maps Pre-release
Pre-release

Choose a tag to compare

@carterbox carterbox released this 04 Jun 15:27

Enhancements

  • Add coverage maps as a metric
  • Add wood-like phantom

Hierarchical Phantoms

Hierarchical Phantoms Pre-release
Pre-release

Choose a tag to compare

@carterbox carterbox released this 23 May 21:40

Enhancements

  • Speed of polytope library improved.
  • Uses sphinxnb to automatically integrate demo notebooks into documentation.

Changed

  • Phantom definitions are now hierarchical. Phantoms are may be nested inside each other. The Feature class is removed.
  • Implements __repr__ for saving and loading phantoms. The old save and load methods are deprecated.

Documentation Update

Documentation Update Pre-release
Pre-release

Choose a tag to compare

@carterbox carterbox released this 29 Jan 07:49

This update mostly concerns improvement of generation and readability of the docs pages.

Polytope for computing polygon intersections

Choose a tag to compare

@carterbox carterbox released this 18 Nov 18:49

The main difference between this release and v0.1 is that the intersections of shapes beyond circles is calculated using the polytope library. This library was compared with other computational geometry libraries and was found to be faster because it uses linear systems of equations instead of symbolic computation.

Also, this version laid the groundwork for N-dimensional compatibility. Mainly, Points are specified with a list of coordinates instead of each coordinate as its own comma separated entry.