Friday, September 17, 2021 - 13:00 to 15:00
SCHOOL OF COMPUTER SCIENCE
The School of Computer Science is pleased to present…
MSc Thesis Defense by: Rishav Chatterjee
Date: Friday September 17th, 2021
Time: 1:00 PM to 3:00 PM
Meeting URL: https://us06web.zoom.us/j/82408597299?from=addon
Passcode: If interested in attending this event, contact the Graduate Secretary at email@example.com with suffient notice before the event to obtain the passcode.
The term packing refers to the arrangement of multiple geometrical structures or shapes such as circles, squares, triangles, or polygons into a fixed and finite set of points. The geometric structures to be packed can also be trees and paths. Packing is also possible in a 3-dimesional space with geometric structures such as spheres, cylinders, and cubes.
The concept of packing was introduced more than half a century ago. Since then, many researchers have studied the packing strategies of different geometric structures in different configurations of point-set. Packing strategies help to construct and arrange multiple geometric structures in a predetermined bounded space, hence, it can be classified as optimization problem, as we are trying to allocate the optimal space for resources in a finite bounded space. The better the efficiency of algorithm, the greater number of items can be packed. Packing geometrical structures have applications in storage, transportation, and transmission of objects in fields like automobile, aerospace, and naval industries.
Since, in real life scenario, resources are finite and space is limited, thus it raises the question, how to efficiently use a limited space for accommodating multiple resources. However, packing multiple geometric structures can raise some design considerations. In our research, we have studied the packing of non-self-crossing, edge-disjoint plane spanning paths and have obtained some promising results. We further address some design considerations and provide a different approach on packing at least two non-self-crossing, edge-disjoint plane spanning paths into a point-set.
Keywords: Packing, Non-self-crossing, Edge-disjoint, Spanning Path
MSc Thesis Committee:
Internal Reader: Dr. Asish Mukhopadhyay
External Reader: Dr. Balakumar Balasingam
Advisor: Dr. Ahmad Biniaz
Chair: Dr. Pooya Moradian Zadeh
MSc Thesis Defense Announcement
5113 Lambton Tower 401 Sunset Ave. Windsor ON, N9B 3P4 (519) 253-3000 Ext. 3716 firstname.lastname@example.org (working remotely)