Searching for Point Locations Using Lines

SummarySuppose there are n points that we wish to locate on a plane. Instead of the locations of the points, we are given all the lines of k distinct slopes that contain the points. We show that the minimum number of slopes needed, in general, to find all the point locations is n + 1 and we provide an algorithm to do so. Additional informationNotes on contributorsMichelle Cordier Michelle Cordier (M.Doyle@chatham.edu) is a professor at Chatham University where she teaches mathematics and physics. She received her Ph.D. in mathematics from Kent State University. She enjoys being a member of the Mathematical Association of America Project New Experiences in Teaching (NExT) where she continually is changing her teaching style to incorporate her students.Meaghan Wheeler Meaghan Wheeler (meaghanwheeler99@gmail.com) is a microbiologist in the medical device industry. She received her bachelors in Biomedical Engineering from the University of Miami. She enjoys working as a microbiologist where she assists in the development of biocompatibility, cleaning, disinfection, and sterilization strategies for product launches.