File:Megiddo's minimum enclosing circle algorithm prune stage2.png

Page contents not supported in other languages.
This is a file from the Wikimedia Commons
From Wikipedia, the free encyclopedia

Original file(931 × 724 pixels, file size: 163 KB, MIME type: image/png)

This geometry image could be re-created using vector graphics as an SVG file. This has several advantages; see Commons:Media for cleanup for more information. If an SVG form of this image is available, please upload it and afterwards replace this template with {{vector version available|new image name}}.


It is recommended to name the SVG file “Megiddo's minimum enclosing circle algorithm prune stage2.svg”—then the template Vector version available (or Vva) does not need the new image name parameter.

Summary

Description
Čeština: Z os dvojic (A,B), (C,D), ... , (S,T) orientovaných dle poloroviny určené osou dvojice (A,B) (zobrazena červeně) byl určen mediánový směr odpovídající červeně zobrazené ose dvojice (G,H). Osy byly spárovány tak, aby směr osy dvojice (G,H) byl mezi směry os v dvojici a byly nalezeny průsečíky A1, B1, C1, D1, E1 vzniklých párů. Modrá rovnoběžka s jenou červenou osou procházející bodem C1 rozděluje tyto průsečíky tak, že v každé polorovině jsou 3. Výsledek hledání nejmenší kružnice se středem na této přímce, obsahující body A,...,U určí, že střed nejmenší kružnice bez omezení leží v "horní" polorovině. Proto je zvolena modrá kolmice procházející bodem D1 (rozděluje průsečíky B1,C1,D1 dolní poloroviny tak, že v každé polorovině jsou 2. Výsledek hledání nejmenší kružnice se středem na této přímce, obsahující body A,...,U určí, že střed nejmenší kružnice bez omezení leží v "levé" polorovině. Proto z os určujících body B1 ((E,F),(O,P)) a D1 ((T,S),(K,L)) můžeme vybrat po jedné, neprotínající kvadrant v němž leží střed hledané kružnice ((E,F), (T,S)), garantující který bod z bodů určujících osu je středu blíž (E, T), ať je střed v příslušné čtvrtrovině kdekoli.
English: The median direction of the bisectors of pairs (A, B), (C, D), ..., (S, T) oriented to half-pollen determined by the bisector of pair (A, B) (colored red) is direction of bisector of (G, H) (colored red).

The bisectors were paired so that the bisector direction of the pair (G, H) was between the bisector directions in the pair. The intersections A1, B1, C1, D1, E1 of the resulting pairs were found. The blue parallel line with a red line passing through the C1 point divided these intersections so that there were 3 in each half. The result of search for the smallest circle with the center on this line containing points A, ..., U determined that the center of the smallest circle without constraint lies in "upper" half-pollen. Therefore, a blue parallel line to other red line was chosen to pass through D1 (dividing the intersections B1, C1, D1 of the lower half-pollen such that each part contatins 2 of them).

The result of searching for the smallest circle with the center on this line containing points A, ..., U determined that the center of the smallest circle without constraint is in the "left" half-pollen, so there is in the bisectors determining points B1 ((E, F), (O, P)) and D1 ((T, S), (K, L)) a bisector nonintersecting quadrant in which the center of the circle searched is ((E, F), (T, S)). It guarantees which point from the pair is closer to the circle center, wherever the center is in the appropriate quarter.
Date
Source Own work
Author Hippo.69

Licensing

I, the copyright holder of this work, hereby publish it under the following license:
w:en:Creative Commons
attribution share alike
This file is licensed under the Creative Commons Attribution-Share Alike 4.0 International license.
You are free:
  • to share – to copy, distribute and transmit the work
  • to remix – to adapt the work
Under the following conditions:
  • attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  • share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.

Captions

Run of Megiddo's algorithm phase, discarding from point set A,B,...,U needless points E, T.

Items portrayed in this file

depicts

5 March 2019

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current00:40, 5 March 2019Thumbnail for version as of 00:40, 5 March 2019931 × 724 (163 KB)Hippo.69User created page with UploadWizard
The following pages on the English Wikipedia use this file (pages on other projects are not listed):

Metadata