Kinetic kd-trees and longest-side kd-trees

DOI10.1137/070710731MaRDI QIDQ3586177zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Mohammad A. Abam, Bettina Speckmann, Mark de Berg

Publication date 6 September 2010

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/070710731

zbMATH Keywords

computational geometryrange searchingkinetic data structureskd-trees

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Kinetic KD-trees and longest-side KD-trees
• scientific article; zbMATH DE number 1947377
• Kinetic and dynamic data structures for closest pair and all nearest neighbors
• scientific article; zbMATH DE number 1670657
• Soft kinetic data structures

Cited in

(3)

• scientific article; zbMATH DE number 1947377 (Why is no real title available?)
• Kinetic data structures for all nearest neighbors and closest pair in the plane
• Kinetic KD-trees and longest-side KD-trees

This page was built for publication: Kinetic kd-trees and longest-side kd-trees

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