KSCommons

Optimum Arrangement Of Points

Show simple item record

dc.contributor.author Derek Blunt
dc.date.accessioned 2018-01-23T20:22:08Z
dc.date.available 2018-01-23T20:22:08Z
dc.date.issued 04/11/2015
dc.identifier.uri http://hdl.handle.net/20.500.12088/7625
dc.description dc.description
dc.description.abstract 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.
dc.description.sponsorship Vincent Ferlini
dc.language.iso en_US
dc.publisher Keene State College
dc.subject Mathematics
dc.title Optimum Arrangement Of Points
dc.type Presentation


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search


Browse

My Account