Algorithms for laying points optimally on a plane and a circle

Details Algorithms for laying points optimally on a plane and a circle Algorithms for laying points optimally on a plane and a circle

2007-05-02

arxiv.org/abs/0705.0350v1

Computer Science

Computational Geometry

AmSTeX, 6 pages, amsppt style

Scientific paper

Two averaging algorithms are considered which are intended for choosing an
optimal plane and an optimal circle approximating a group of points in
three-dimensional Euclidean space.

Affiliated with

Also associated with

No associations

Rating

Algorithms for laying points optimally on a plane and a circle does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithms for laying points optimally on a plane and a circle, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for laying points optimally on a plane and a circle will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-675357