Kinetic hanger

DOI10.1016/J.IPL.2003.10.010MaRDI QIDQ1029070zbMATH OpenOpenAlexFDO

Authors Paulo Cezar Pinto Carvalho, Guilherme D. Da Fonseca, Celina M. H. de Figueiredo

Publication date 9 July 2009

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

Full work available at URL https://doi.org/10.1016/j.ipl.2003.10.010

zbMATH Keywords

data structureskinetic hangerkinetic priority queue

Mathematics Subject Classification ID

Data structures (68P05)

Cites work

• scientific article; zbMATH DE number 1617248 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 732977 (Why is no real title available?)
• Applications of random sampling in computational geometry. II
• Data Structures for Mobile Data
• Kinetic heap-ordered trees: Tight analysis and improved algorithms
• Randomized search trees
• Reporting red-blue intersections between two sets of connected line segments

Cited in

(1)

• A 2D advancing-front Delaunay mesh refinement algorithm

This page was built for publication: Kinetic hanger

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