Kinetic sorting and kinetic convex hulls

DOI10.1145/1064092.1064122MaRDI QIDQ5370612zbMATH OpenOpenAlexFDO

Authors Mohammad A. Abam, Mark de Berg

Publication date 20 October 2017

Published in Proceedings of the twenty-first annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1064092.1064122

zbMATH Keywords

lower boundskinetic data structureskinetic convex hullskinetic sorting

Mathematics Subject Classification ID

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

Recommendations

• Kinetic sorting and kinetic convex hulls
• Algorithms and Data Structures
• Kinetic and dynamic data structures for convex hulls and upper envelopes
• Maintaining the extent of a moving point set
• Maintaining the extent of a moving point set

Cited in

(12)

• Maintaining the extent of a moving point set
• scientific article; zbMATH DE number 1947377 (Why is no real title available?)
• Out-of-order event processing in kinetic data structures
• Algorithms and Data Structures
• Kinetic and dynamic data structures for convex hulls and upper envelopes
• Kinetic sorting and kinetic convex hulls
• Out-of-Order Event Processing in Kinetic Data Structures
• Kinetic convex hulls and Delaunay triangulations in the black-box model
• Kinetic dictionaries: how to shoot a moving target
• Soft kinetic data structures
• Maintaining the extent of a moving point set
• Robust Kinetic Convex Hulls in 3D

This page was built for publication: Kinetic sorting and kinetic convex hulls

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