#### Re: Points on sphere

Hello, Kodt, you wrote: - round each triangle to draw a segment It after all it is possible to make two methods, and to receive two segments - additions each other. You suggest to add both of them?

#### Re: Points on sphere

Hello, Kodt, you wrote: And if on sphere exactly three points the decision is degenerated clearly as it seems To me that if at us it is some the points lying on a circle of the small size the last step of your algorithm receives not a small segment in this circle, and its addition.

#### Re: Points on sphere

Hello, nikov, you wrote: N> On sphere the coordinate system is set, allowing to specify position of a point by means of its latitude and a longitude. The finite set of points on the sphere, set in the coordinates is given. To find the spherical cap of the least area containing all points of this set (i.e. to find coordinates of its middle and its angular size). To construct a Voronoi diagram, for example, this algorithm. For constant time to check up each of points in which boundaries of cells Black converge. Each such point - the spherical cap middle, a corner between it and center of any adjacent cell - the maximum angular size of a spherical cap. It turns out that dares during O (NlogN) from an amount of points.

#### Re: Points on sphere

Hello, watchmaker, you wrote: W> to Construct a Voronoi diagram, for example, this algorithm. Coordinates of points with a margin error how then to resolve sphere?