Category:Smallest circle problem
Jump to navigation
Jump to search
Internationalization
English: find the smallest circle enclosing a finite set of points.
Français : trouver le cercle minimum contenant un ensemble fini de points.
mathematical problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane | |||||
| Upload media | |||||
| |||||
 | |||||
Media in category "Smallest circle problem"
The following 13 files are in this category, out of 13 total.
-
Cas triviaux cercle minimum.svg 127 × 127; 51 KB
-
Cercle minimum algo geometrique diametre.svg 837 × 769; 28 KB
-
Cercle minimum algo geometrique triangle.svg 724 × 696; 29 KB
-
Cercle minimum chrystal triangle.svg 608 × 589; 26 KB
-
Cercle minimum shamos triangle.svg 638 × 674; 29 KB
-
Chybný výsledek Welzlova algoritmu.png 570 × 669; 44 KB
-
Megiddo's minimum enclosing circle algorithm prune stage.png 1,085 × 812; 226 KB
-
Megiddo's minimum enclosing circle algorithm prune stage2.png 931 × 724; 163 KB
-
Original Welzl's Algorithm Counter Example.png 597 × 561; 28 KB
-
Original Welzl's Algorithm Counter Example2.png 571 × 533; 27 KB
-
Smallest circle problem.svg 800 × 800; 3 KB
-
Welzl's algorithm counterexample 2.png 501 × 400; 29 KB
-
Welzl's algorithm counterexample.png 974 × 814; 21 KB
