diff options
| author | mzuenni <mzuenni@users.noreply.github.com> | 2024-07-28 22:54:40 +0200 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2024-07-28 22:54:40 +0200 |
| commit | 8d11c6c8213f46f0fa19826917c255edd5d43cb1 (patch) | |
| tree | 96d75baff33d5a04b5a60f1a41f514a26c716874 /geometry/geometry.tex | |
| parent | 8c33b4e0d3030cfed17fc64b4fe41133339f6d87 (diff) | |
Test (#4)
* update
* moved content in subdir
* rename file
* add test setup
* add test setup
* add github action
* automaticly test all cpp files
* timeout after 10s
* setulimit and dont zero memory
* test build pdf
* install latexmk
* update
* update
* ngerman
* fonts
* removed old code
* add first test
* added tests
* test in sorted order
* more tests
* simplified test
* more tests
* fix suffix tree
* fixes and improvements
* done ust lst directly
* fix swap
* add links to pdf
* fix constants
* add primorial
* add comment
* various improvements
* more tests
* added missing stuf
* more tests
* fix tests
* more tests
* more tests
* more tests
* fix recursion?
* test trie
* more tests
* only use python temporarily for listings
* only use python temporarily for listings
* more tests
* fix longestCommonSubstring
* more tests
* more tests
* made code more similiar
* fix?
* more tests
* more tests
* more tests
* add ahoCorasick test + limit 4GB stack size
* more tests
* fix test
* add additional test
* more tests
* more tests
* fix?
* better fix
* fix virtual tree
* more tests
* more tests
* recursive closest pair
* more tests
* decrease limit
* new tests
* more tests
* fix name
* more tests
* add test
* new test
* more tests
* more tests
* more tests
* more tests
* new test and content
* new code
* new code
* larger tests
* fix and test
* new test
* new test
* update pdf
* remove comments
* new test
* more tests
* more testcases
* more tests
* increased limit
* more tests
* more tests
* more tests
* new tests
* more tests
* shortened code
* new test
* add basic tests for bigint
* more tests
* removed old files
* new test
* ignore some files
* more auto more ccw
* fix test
* more tests
* fix
* new tests
* more tests
* more tests
* stronger test
* actually verify delaunay...
* more tests
* fix header
* more tests
* run tests parallel?
* test parralel?
* add --missing
* separate workflows
* test
* is the pdf checked?
* separate workflows
* fix workflow
* more workflows
---------
Co-authored-by: Yidi <noob999noob999@gmail.com>
Diffstat (limited to 'geometry/geometry.tex')
| -rw-r--r-- | geometry/geometry.tex | 62 |
1 files changed, 0 insertions, 62 deletions
diff --git a/geometry/geometry.tex b/geometry/geometry.tex deleted file mode 100644 index 95c0adb..0000000 --- a/geometry/geometry.tex +++ /dev/null @@ -1,62 +0,0 @@ -\section{Geometrie} - -\begin{algorithm}{Closest Pair} - \begin{methods} - \method{shortestDist}{kürzester Abstand zwischen Punkten}{n\*\log(n)} - \end{methods} - \sourcecode{geometry/closestPair.cpp} -\end{algorithm} - -\begin{algorithm}{Rotating calipers} - \begin{methods} - \method{antipodalPoints}{berechnet antipodale Punkte}{n} - \end{methods} - \textbf{WICHTIG:} Punkte müssen gegen den Uhrzeigersinn sortiert sein und konvexes Polygon bilden! - \sourcecode{geometry/antipodalPoints.cpp} -\end{algorithm} - -\begin{algorithm}{Konvexehülle} - \begin{methods} - \method{convexHull}{berechnet konvexe Hülle}{n\*\log(n)} - \end{methods} - \begin{itemize} - \item Konvexe Hülle gegen den Uhrzeigersinn sortiert - \item nur Eckpunkte enthalten(für alle Punkte = im CCW Test entfernen) - \item erster und letzter Punkt sind identisch - \end{itemize} - \sourcecode{geometry/convexHull.cpp} -\end{algorithm} - -\subsection{Formeln~~--~\texttt{std::complex}} -\sourcecode{geometry/formulars.cpp} -\sourcecode{geometry/linesAndSegments.cpp} -\sourcecode{geometry/sortAround.cpp} -\input{geometry/triangle} -\sourcecode{geometry/triangle.cpp} -\sourcecode{geometry/polygon.cpp} -\sourcecode{geometry/circle.cpp} - -\subsection{Formeln - 3D} -\sourcecode{geometry/formulars3d.cpp} - -\optional{ - \subsection{3D-Kugeln} - \sourcecode{geometry/spheres.cpp} -} - -\begin{algorithm}{Half-plane intersection} - \sourcecode{geometry/hpi.cpp} -\end{algorithm} - -\begin{algorithm}[optional]{Delaunay Triangulierung} - \begin{methods} - \method{delaunay}{berechnet Triangulierung}{n\*\log(n)} - \end{methods} - \textbf{WICHTIG:} Wenn alle Punkte kollinear sind gibt es keine Traingulierung! Wenn 4 Punkte auf einem Kreis liegen ist die Triangulierung nicht eindeutig. - \sourcecode{geometry/delaunay.cpp} -\end{algorithm} - -\optional{ -\subsection{Geraden} -\sourcecode{geometry/lines.cpp} -} |
