The report of the bachelor project (thesis) of 3rd year CS bachelor at USI. Project can be found at https://git.karma-riuk.com/karma/flying-balls
Go to file
2023-08-02 16:38:06 +02:00
figures Finished the conclusion 2023-06-22 18:19:31 +02:00
sections applyed edits from Prof. Carzaniga 2023-08-02 12:08:41 +02:00
tikzs Finished the implementation section 2023-06-22 18:19:12 +02:00
.gitignore Added file to gitignore 2023-06-07 11:57:17 +02:00
bachelorproject.pdf Added final pdfs 2023-08-02 12:08:49 +02:00
bachelorproject.tex applyed edits from Prof. Carzaniga 2023-08-02 12:08:41 +02:00
BP_Arnaud_Fauconnet.pdf Added final pdfs 2023-08-02 12:08:49 +02:00
README.md Added some stats 2023-08-02 16:38:06 +02:00
references.bib Reordered bib file 2023-06-07 11:56:37 +02:00
usiinfbachelorproject.cls Made the sections back to bold 2023-06-07 11:55:51 +02:00

From Flying Balls to Colliding Polygons

Report

This repository contains the tex files that I wrote for the report of the Bachelor Project (thesis) during my third year at Università della Svizzera Italiana (USI).

The report goes into great detail on the different steps that were taken during the development of the project. It focuses mostly on the theoretical aspect of the project, as this report should resemble an "official paper" (like a master thesis). The implementation is however not discarded completely, but it is discussed in a broad overview without going to deep in implementation details. If you are interested in such details, feel free to take a look at the code at karma-riuk/flying-balls.

The full report is available here. It contains 4905 words (as per the texcount -1 -merge -sum bachelorproject.tex command) spanned over 22 pages.

Table of contents

Here is the table of contents of the report

  1. Introduction
    1. Goal of the project
    2. State of the art
  2. Technical Background
    1. Original project
    2. Cairo
  3. Technical Background
    1. Moment of Inertia
    2. Regular Polygons
    3. Arbitrary Polygons
  4. Implementation
    1. Structure
    2. Optimization
    3. Known Issues
  5. Conclusion

Contact

If you have any question concerning this work, feel free to contact me at arno.fauconnet@gmail.com