Work

Point Location in Incremental Planar Subdivisions

Year: 2018

Type: preprint

Abstract: We study the point location problem in incremental (possibly disconnected) planar subdivisions, that is, dynamic subdivisions allowing insertions of edges and vertices only. Specifically, we present an $O(n\log n)$-space data structure for this problem that supports queries in $O(\log^2 n)$ time and updates in $O(\log n\log\log n)$ amortized time. This is the first result that achieves polylogarithmic query and update times simultaneously in incremental (possibly disconnected) planar subdivisions. Its update time is significantly faster than the update time of the best known data structure for fully-dynamic (possibly disconnected) planar subdivisions.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1809.10495

Author: Oh, Eunjin

Institutions: Max Planck Society, Max Planck Institute for Informatics

Language: English

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2953030528

Cites:

Cited by:

Related to: 10