Kinetic hanger

DOI10.1016/j.ipl.2003.10.010zbMath1178.68181OpenAlexW2912185090MaRDI QIDQ1029070

Paulo C. P. Carvalho, Celina M. Herrera de Figueiredo, Guilherme Dias da Fonseca

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)

Related Items (1)

A 2D advancing-front Delaunay mesh refinement algorithm

Cites Work

• Applications of random sampling in computational geometry. II
• Kinetic heap-ordered trees: Tight analysis and improved algorithms
• Randomized search trees
• Data Structures for Mobile Data
• Reporting red-blue intersections between two sets of connected line segments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Kinetic hanger