Presentation Title

Optimum Arrangement Of Points

Presenter Information

Derek Blunt

Mentor

Vincent Ferlini

Location

David F. Putnam Science Center - 102

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.

Share

COinS
 
Apr 11th, 9:10 AM Apr 11th, 10:10 AM

Optimum Arrangement Of Points

David F. Putnam Science Center - 102

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.