Dynamic rectangular point location, with an application to the closest pair problem

DOI10.1006/INCO.1995.1001MaRDI QIDQ1346711zbMATH OpenOpenAlexFDO

Authors Michiel Smid

Publication date 10 April 1995

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11858/00-001M-0000-0014-7AFA-8

zbMATH Keywords

data structure

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• An optimal algorithm for closest-pair maintenance
• scientific article; zbMATH DE number 437555
• Dynamic closest pairs — A probabilistic approach
• Randomized Data Structures for the Dynamic Closest-Pair Problem
• scientific article; zbMATH DE number 742974

Cited in

(7)

• An optimal algorithm for the on-line closest-pair problem
• An optimal algorithm for closest-pair maintenance
• scientific article; zbMATH DE number 437555 (Why is no real title available?)
• scientific article; zbMATH DE number 742974 (Why is no real title available?)
• Lattice structures of automata
• I/O-Efficient Point Location in a Set of Rectangles
• scientific article; zbMATH DE number 5046292 (Why is no real title available?)

This page was built for publication: Dynamic rectangular point location, with an application to the closest pair problem

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