Title

Dynamic planar point location in optimal time

Document Type

Conference Proceeding

Publication Date

6-15-2021

Department

Department of Computer Science

Abstract

In this paper we describe a fully-dynamic data structure that supports point location queries in a connected planar subdivision with n edges. Our data structure uses O(n) space, answers queries in O(logn) time, and supports updates in O(logn) time. Our solution is based on a data structure for vertical ray shooting queries that supports queries and updates in O(logn) time.

Publication Title

Proceedings of the Annual ACM Symposium on Theory of Computing

ISBN

9781450380539

COinS