i want to solve the smallest-circle problem of a convex polygon with arbitrary nodes with geogebra.
I know how to do it for a triangle, but that does not help me with other convex polygons. I read about some algorithms (e.g. Welzl algorithm), but i don't know how to implement it in geogebra. Does anyone have experience with that?