# # Identify this run: # targetInputFile tiInputTargets.fit # FITS binary table of targets to tile targetOutputFile tiOutputTargets.fit # FITS binary table of targets to ti le tileOutputFile tileOut.par # ASCII file of tiled targets seed 8 # Random number seed firstTile 332 # First tile number tileRun 15 # # Conditions to Satisfy # desCoverage 0.99 # Min fraction of targets to tile desCoverageResolved 0.0 # Min fraction of collisions to recover # # uniformTiling options: # rectangle a rectangular shape, assuming width decreases near poles # rectangleES a rectangular shape, with "equal spacing" # equatorial a one-dimensional stripe along the equator # sloane take a chunk out of the uniform spherical solution # uniformTiling rectangle nTilesSphere 7682 # with "sloane", set full no. of tiles on sphere # # tileSearchFudge: # if >0 : Use a binary search to find smallest number of tiles which # satisfy conditions above; use this value to set initial search # range (1.05 or 1.1 is fine in this case) # if <0 : Use the absolute value to set the number of tiles to use by # hand (e.g. -44 means use exactly 44 tiles). # # For both of these cases, the number of tiles set is set *before* trimming. # That is, the edgeTrim and fractionTrim stuff is applied *after* the # binary search, or after 44 tiles are allocated. # tileSearchFudge 1.05 # # Other Parameters # maxTileIter 50 # how many iterations of cost minimization? moveLimit 0.002 # stop if max movement of any tile is < this (degrees) toSurveyCoords 1 # convert to survey coords edgeTrim 0. # after solution, trim tiles this close to edge (degrees) fractionTrim -0.5 # trim tiles with < this fraction of allocated fibers retainDecollided 0 # # These have to look like above for the opdb # parameters tiParam.par parametersDir . inputFile tiInputTargets.fit outputFile tiOutputTargets.fit outputTCFile tileOut.par tileType survey inputDir . outputDir .