An incremental reconstruction method for dynamic planar point location

DOI10.1016/0020-0190(91)90138-8MaRDI QIDQ750176zbMATH OpenOpenAlexFDO

Authors 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 algorithmscomputational geometrytriangulationson-line algorithmpoint locationplanar subdivisiondynamic data structure

Mathematics Subject Classification ID

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

Recommendations

• Dynamic planar point location with optimal query time
• Towards an optimal method for dynamic planar point location
• Dynamic planar point location with optimal query time (extended abstract)
• Fully Dynamic Point Location in a Monotone Subdivision
• DYNAMIZATION OF THE TRAPEZOID METHOD FOR PLANAR POINT LOCATION IN MONOTONE SUBDIVISIONS

Cites work

• scientific article; zbMATH DE number 3887061 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• A New Approach to Planar Point Location
• Decomposable searching problems I. Static-to-dynamic transformation
• Dynamic planar point location with optimal query time
• Fully Dynamic Point Location in a Monotone Subdivision
• Location of a Point in a Planar Subdivision and Its Applications
• Optimal Point Location in a Monotone Subdivision
• Optimal Search in Planar Subdivisions
• Optimal dynamization of decomposable searching problems
• The design of dynamic data structures

Cited in

(2)

• Point Location in Incremental Planar Subdivisions.
• Incremental hive graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750176)