Kinetic sorting and kinetic convex hulls

DOI10.1016/j.comgeo.2006.02.004zbMath1113.65017OpenAlexW2205245699MaRDI QIDQ871059

Mohammad Ali Abam, Mark T. de Berg

Publication date: 15 March 2007

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2006.02.004

zbMATH Keywords

Computational geometryLower boundsKinetic convex hullsKinetic data structuresKinetic sorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (1)

Complexity analysis and performance of double hashing sort algorithm

Cites Work

• On ray shooting in convex polytopes
• Reporting points in halfspaces
• Indexing moving points
• Lower bounds for kinetic planar subdivisions
• Data Structures for Mobile Data
• Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
• Algorithms – ESA 2004
• Algorithms - ESA 2003
• Kinetic connectivity for unit disks
• Maintaining the extent of a moving point set
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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