What to read about geometry in programming?

Question

Books

Good day, dear ones!
Literature on:
1) "geometric algorithms" (for example, an algorithm that allows you to find the minimum circle describing an array of points) is of interest.
2) projective geometry (where linal/quaternions).
For example, to write a ray tracer.

Answer 1

You can start here
algolist.manual.ru/maths/geom

Answer 2

2) Google something on the topic "Computer graphics". There are lecture courses on this subject.
1) I won’t say for sure here, but it’s very reminiscent of clustering tasks. They say we find the center in the array of points, the most distant point from it and this will be the radius of the circle.

Answer 3

Golovanov N. N. "Geometric modeling"
Bobenko A. I., Suris Yu. B. "Discrete differential geometry. Integrable structure"
Get ready for complex mathematics

Answer 4

Specifically on the first question:
1. We sort through all possible triplets of points.
2. Each triple is a triangle. For it, we find the center and radius of the circumscribed circle (specifically, for this subtask, the algorithm is easily googled).
3. We check whether all other points are inside this triangle, and whether this circle is smaller than those previously found.
I suspect that some heuristics can be added here to cut off obviously inappropriate triples without running all the calculations - this will be relevant for a large number of points. But what kind of heuristics - I can not think of.

Answer 5

https://www.edx.org/course/computer-graphics-uc-sa...
https://www.edx.org/course/computational-geometry-...
ocw.mit.edu/courses/mechanical -engineering/2-158j-...