[-] Show simple item record

dc.contributor.advisorHan, Yijie, 1959-
dc.contributor.authorGonuguntla, Mounika
dc.date.issued2024
dc.date.submitted2024 Spring
dc.descriptionTitle from PDF of title page, viewed May 29, 2024
dc.descriptionThesis advisor: Yijie Han
dc.descriptionVita
dc.descriptionIncludes bibliographical references (pages 13-14)
dc.descriptionThesis (M.S.)--Department of Computer Science and Electrical Engineering. University of Missouri--Kansas City, 2024
dc.description.abstractWe preprocess the input subdivision with n points on the plane in O(n√log n) time and store them in O(n/t) space to facilitate point location in O(log t) time, where t is an adjustable parameter. When t is a constant we get O(n) space and constant time. When t = O(n) we get constant space and O(log n) time.
dc.description.tableofcontentsIntroduction -- The O(N√log N) time sorting algorithm for sorting real numbers -- Point location -- Main theorem -- Conclusions
dc.format.extentvi, 15 pages
dc.identifier.urihttps://hdl.handle.net/10355/101208
dc.subject.lcshAlgorithms -- Computer programs
dc.subject.lcshSpace and time -- Data processing
dc.subject.otherThesis -- University of Missouri--Kansas City -- Computer Science
dc.titleTime and space tradeoffs in point location
thesis.degree.disciplineComputer Science (UMKC)
thesis.degree.grantorUniversity of Missouri--Kansas City
thesis.degree.levelMasters
thesis.degree.nameM.S. (Master of Science)


Files in this item

[PDF]

This item appears in the following Collection(s)

[-] Show simple item record