Kinetic sorting and kinetic convex hulls

DOI10.1016/J.COMGEO.2006.02.004zbMATH Open1113.65017OpenAlexW2205245699MaRDI QIDQ871059

Mohammad A. Abam, Mark 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) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Data Structures for Mobile Data
• Maintaining approximate extent measures of moving points
• On ray shooting in convex polytopes
• Reporting points in halfspaces
• Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
• Indexing moving points
• Maintaining the extent of a moving point set
• Kinetic connectivity for unit disks
• Lower bounds for kinetic planar subdivisions
• Algorithms - ESA 2003
• Algorithms – ESA 2004

Cited In (1)

• Complexity analysis and performance of double hashing sort algorithm

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 Q871059)