An incremental reconstruction method for dynamic planar point location

DOI10.1016/0020-0190(91)90138-8zbMath0713.68099OpenAlexW2072485679MaRDI QIDQ750176

Roberto Tamassia

Publication date: 1991

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90138-8

zbMATH Keywords

analysis of algorithmson-line algorithmtriangulationscomputational geometrypoint locationplanar subdivisiondynamic data structure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Incremental hive graph

Cites Work

• Unnamed Item
• Unnamed Item
• The design of dynamic data structures
• Dynamic planar point location with optimal query time
• Optimal dynamization of decomposable searching problems
• Optimal Point Location in a Monotone Subdivision
• Decomposable searching problems I. Static-to-dynamic transformation
• A New Approach to Planar Point Location
• Optimal Search in Planar Subdivisions
• Location of a Point in a Planar Subdivision and Its Applications
• Fully Dynamic Point Location in a Monotone Subdivision

This page was built for publication: An incremental reconstruction method for dynamic planar point location