| apt install git | |
| git clone https://gitlab.com/st42/termux-sudo | |
| cd termux-sudo | |
| cat sudo > /data/data/com.termux/files/usr/bin/sudo | |
| chmod 700 /data/data/com.termux/files/usr/bin/sudo |
| import json | |
| import csv | |
| import matplotlib.pyplot as plt | |
| import matplotlib.ticker as ticker | |
| ''' | |
| Difficulty checks are coded in the following format: | |
| [3] | |
| 0 Field data |
The Gilbert–Johnson–Keerthi (GJK) distance algorithm is a method of determining the minimum distance between two convex sets. The algorithm's stability, speed which operates in near-constant time, and small storage footprint make it popular for realtime collision detection.
Unlike many other distance algorithms, it has no requirments on geometry data to be stored in any specific format, but instead relies solely on a support function to iteratively generate closer simplices to the correct answer using the Minkowski sum (CSO) of two convex shapes.
| import struct | |
| def decode_struct(data): | |
| ret = [] | |
| i = 0 | |
| while i < len(data): | |
| tag = data[i:i+4].decode('ascii') | |
| length = struct.unpack('>I', data[i+4:i+8])[0] | |
| value = data[i+8:i+8+length] | |
| value = decode(value, tag=tag) |
| Author | Quote | |
|---|---|---|
| Thomas Edison | Genius is one percent inspiration and ninety-nine percent perspiration. | |
| Yogi Berra | You can observe a lot just by watching. | |
| Abraham Lincoln | A house divided against itself cannot stand. | |
| Johann Wolfgang von Goethe | Difficulties increase the nearer we get to the goal. | |
| Byron Pulsifer | Fate is in your hands and no one elses | |
| Lao Tzu | Be the chief but never the lord. | |
| Carl Sandburg | Nothing happens unless first we dream. | |
| Aristotle | Well begun is half done. | |
| Yogi Berra | Life is a learning experience, only if you learn. |
