Optimum Arrangement Of Points
Item
- Description
- Given an area enclosed by a convex curve, the problem is to find the optimal arrangement of N points within the boundary such that the minimum distance between any two points is as large as possible. This particular problem is closely related to the optimal packing of N equally sized circles in the same boundary such that the radius of the circles is as large as possible. This talk will concentrate on the cases where the convex curve is a circle, equilateral triangle, and a square, and the values are less than 20.
- Vincent Ferlini
- Contributor
- Keene State College
- Creator
- Derek Blunt
- Date
- 2015-04-11
- Identifier
- http://hdl.handle.net/20.500.12088/7625
- Language
- en_US
- Subject
- Mathematics
- Type
- Presentation
- Rights
- http://rightsstatements.org/vocab/InC/1.0/
- Item sets
- AEC 2015 Sciences
- Site pages
- Sciences
Position: 2066 (96 views)