1 INTRODUCTION
2 TILING CHALLENGE
2.1 Input data for the tiling algorithm
2.2 Expected output of the tiling algorithm
2.3 Proposed tiling algorithm in a nutshell
3 MARKED POINT PROCESS FOR DETERMINING OPTIMAL TILING PATTERN
3.1 Mathematical set-up of the problem
3.2 Model construction
3.3 Simulation method
4 APPLICATION OF THE TILING ALGORITHM
4.1 Example using Poisson-distributed targets
4.2 Example using mock catalogues
4.3 Tiling and probabilistic fibre-to-target assignment
4.4 Tiling with bright, grey and dark time division
4.5 Performance analysis of the tiling algorithm
5 CONCLUSIONS AND DISCUSSION