Overall Plan¶
- Use a simple geometric shape for each tile, e.g., hexagon or square (probably hexagon)
- allocate fibers within one tile via simulated annealing with probabilities/priorities given from other subgroups
- with the given tile shape, the tiling will be simple in order to achieve simple selection function
Input/Output¶
Inputs¶
| Item | Par/Data | Data Type | Prior | Range | Units | From Where | Explanation |
|---|---|---|---|---|---|---|---|
| Number of fibers | par | int | 5000 | 3000,6000 | n/a | Fiber Sys | number of fibers that will be used |
| Tile Shape/size | par | string | Hexagon | 3 shapes | n/a | Fiber Sys | which shape the arrange of fibers take |
| Fiber Patrol Radius | par | float | 6.0 | 5,7 | mm | Fiber Sys | the radial range tha ta fiber can travel to be matched to a galaxy |
| Minimum inter-fiber distance | par | float | 1.2 | 0.8 - 2.0 | mm | Fiber Sys | the minimum distance between two fibers during their closest mutual approach |
outputs:¶
| Item | Par/Data | Data Type | Prior | Range | Units | From Where | Explanation |
|---|---|---|---|---|---|---|---|
| completeness tag on galaxy cat | data | int | n/a | 0,1 | n/a | Throughput | whether a galaxy was obtained or not during the matching process |
Quality Assessment Tests¶
- completeness as a function of the other inputs
- fiber efficiency as a function of the other inputs
- timing tests
- selection function recovery