Algorithms and Data Structures

DOI10.1007/11534273zbMATH Open1161.68394OpenAlexW3010016474MaRDI QIDQ5394256FDOQ5394256

Authors: Giora Alexandron, Haim Kaplan, Micha Sharir 

Publication date: 25 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11534273

Recommendations

• Kinetic and dynamic data structures for convex hulls and upper envelopes
• Kinetic sorting and kinetic convex hulls
• scientific article; zbMATH DE number 1617248
• Maintaining the extent of a moving point set
• Maintaining the extent of a moving point set

Mathematics Subject Classification ID

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

Cited In (15)

• Kinetic sorting and kinetic convex hulls
• Kinetic and dynamic data structures for convex hulls and upper envelopes
• Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model
• Title not available (Why is that?)
• A kinetic triangulation scheme for moving points in the plane
• Kinetic sorting and kinetic convex hulls
• Kinetic convex hulls and Delaunay triangulations in the black-box model
• Kinetic and dynamic data structures for closest pair and all nearest neighbors
• Efficient update strategies for geometric computing with uncertainty
• Relative convex hulls in semi-dynamic arrangements
• A kinetic triangulation scheme for moving points in the plane
• Maintaining the extent of a moving point set
• Kinetic data structures for all nearest neighbors and closest pair in the plane
• Robust Kinetic Convex Hulls in 3D
• Maintaining the extent of a moving point set

This page was built for publication: Algorithms and Data Structures

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