{"id":{"repo_id":"umkc","oai_identifier":"oai:mospace.umsystem.edu:10355/101208"},"canonical_url":"https://search.dev.ndltd.org/etd/umkc/oai:mospace.umsystem.edu:10355/101208","repository":{"repo_id":"umkc","name":"University of Missouri - Kansas City","base_url":"https://mospace.umsystem.edu/oai/request"},"display":{"title":"Time and space tradeoffs in point location","abstract":"We 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.","abstract_html":"We 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.","abstract_has_math":false,"creators":["Gonuguntla, Mounika"],"institution":"University of Missouri--Kansas City","degree_name":"M.S. (Master of Science)","degree_level":"Masters","degree_discipline":"Computer Science (UMKC)","degree_department":null,"school":null,"contributors":[],"advisors":["Han, Yijie, 1959-"],"committee_chairs":[],"committee_members":[],"year":2024,"date_issued":"2024","date_published":"2024","updated_at":"2026-07-24T05:19:02Z","subjects":[],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10355/101208","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Han, Yijie, 1959-"]},{"key":"dc:creator","label":"Author","values":["Gonuguntla, Mounika"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2024-05-21T16:14:14Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2024-05-21T16:14:14Z"]},{"key":"dc:date.issued","label":"Date","values":["2024"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science (UMKC)"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S. (Master of Science)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Missouri--Kansas City"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10355/101208"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Title from PDF of title page, viewed May 29, 2024","Thesis advisor: Yijie Han","Vita","Includes bibliographical references (pages 13-14)","Thesis (M.S.)--Department of Computer Science and Electrical Engineering. University of Missouri--Kansas City, 2024"]},{"key":"dc:description.abstract","label":"Abstract","values":["We 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."]},{"key":"dc:title","label":"Title","values":["Time and space tradeoffs in point location"]}]}],"canonical_facts":{"dc:contributor.advisor":["Han, Yijie, 1959-"],"dc:creator":["Gonuguntla, Mounika"],"dc:date.accessioned":["2024-05-21T16:14:14Z"],"dc:date.available":["2024-05-21T16:14:14Z"],"dc:date.issued":["2024"],"dc:description":["Title from PDF of title page, viewed May 29, 2024","Thesis advisor: Yijie Han","Vita","Includes bibliographical references (pages 13-14)","Thesis (M.S.)--Department of Computer Science and Electrical Engineering. University of Missouri--Kansas City, 2024"],"dc:description.abstract":["We 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:identifier.uri":["https://hdl.handle.net/10355/101208"],"dc:title":["Time and space tradeoffs in point location"],"thesis:degree_discipline":["Computer Science (UMKC)"],"thesis:degree_level":["Masters"],"thesis:degree_name":["M.S. (Master of Science)"],"thesis:institution_name":["University of Missouri--Kansas City"]},"updated_at":"2026-07-24T05:19:02Z"}