Head and Neck Embryology: An Overview of Development, Growth and Defect in the Human Fetus

The purpose of this research is to explore the growth and formation of the head and neck from embryological development through puberty in order to understand how this knowledge is necessary for the development of dental and medical treatments and procedures. This is a necessary aspect of the medical and dental school curriculum at the University of Connecticut Health Center Schools of Medicine and Dental Medicine that needs to be incorporated into the current study of embryology for first-year students. Working with Dr. Christine Niekrash, D.M.D, this paper will cover the embryology and growth of the head, face and oral cavity. The goal of this project will be to organize the information and recognize the resources needed to successfully introduce this part of human physiology to the UConn dental and medical students. One area in which this information is particularly relevant is the facial and oral deformities that can occur throughout fetal development.

Fast Algorithms Using Minimal Data Structures for Common Topological Relationships in Large, Irregularly-spaced Topographic Data Sets

Digital terrain models (DTM) typically contain large numbers of postings, from hundreds of thousands to billions. Many algorithms that run on DTMs require topological knowledge of the postings, such as finding nearest neighbors, finding the posting closest to a chosen location, etc. If the postings are arranged irregu- larly, topological information is costly to compute and to store. This paper offers a practical approach to organizing and searching irregularly-space data sets by presenting a collection of efficient algorithms (O(N),O(lgN)) that compute important topological relationships with only a simple supporting data structure. These relationships include finding the postings within a window, locating the posting nearest a point of interest, finding the neighborhood of postings nearest a point of interest, and ordering the neighborhood counter-clockwise. These algorithms depend only on two sorted arrays of two-element tuples, holding a planimetric coordinate and an integer identification number indicating which posting the coordinate belongs to. There is one array for each planimetric coordinate (eastings and northings). These two arrays cost minimal overhead to create and store but permit the data to remain arranged irregularly.