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/triangle.cpp | |
| 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/triangle.cpp')
| -rw-r--r-- | geometry/triangle.cpp | 43 |
1 files changed, 0 insertions, 43 deletions
diff --git a/geometry/triangle.cpp b/geometry/triangle.cpp deleted file mode 100644 index 33a8394..0000000 --- a/geometry/triangle.cpp +++ /dev/null @@ -1,43 +0,0 @@ -// Mittelpunkt des Dreiecks abc. -pt centroid(pt a, pt b, pt c) {return (a + b + c) / 3.0;} - -// Flächeninhalt eines Dreicks bei bekannten Eckpunkten. -double area(pt a, pt b, pt c) { - return abs(cross(b - a, c - a)) / 2.0; -} - -// Flächeninhalt eines Dreiecks bei bekannten Seitenlängen. -double area(double a, double b, double c) { - double s = (a + b + c) / 2.0; - return sqrt(s * (s-a) * (s-b) * (s-c)); -} - -// Zentrum des größten Kreises im Dreiecke -pt inCenter(pt a, pt b, pt c) { - double x = abs(a-b), y = abs(b-c), z = abs(a-c); - return (y*a + z*b + x*c) / (x+y+z); -} - -// Zentrum des Kreises durch alle Eckpunkte -// a, b und c nicht kollinear -pt circumCenter(pt a, pt b, pt c) { - b -= a, c -= a; - pt d = b * norm(c) - c * norm(b); - d = {-d.imag(), d.real()}; - return a + d / cross(b, c) / 2.0; -} - -// 1 => p außerhalb Kreis durch a,b,c -// 0 => p auf Kreis durch a,b,c -// -1 => p im Kreis durch a,b,c -int insideOutCenter(pt a, pt b, pt c, pt p) {// braucht lll - return sgn(imag((c-b)*conj(p-c)*(a-p)*conj(b-a))); -} - -// Sind die Dreiecke a1, b1, c1, and a2, b2, c2 ähnlich? -// Erste Zeile testet Ähnlichkeit mit gleicher Orientierung, -// zweite Zeile testet Ähnlichkeit mit verschiedener Orientierung -bool similar(pt a1, pt b1, pt c1, pt a2, pt b2, pt c2) { - return (b2-a2) * (c1-a1) == (b1-a1) * (c2-a2) || - (b2-a2) * conj(c1-a1) == conj(b1-a1) * (c2-a2); -} |
