Kinetic sorting and kinetic convex hulls

DOI10.1016/J.COMGEO.2006.02.004MaRDI QIDQ871059zbMATH OpenOpenAlexFDO

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

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

Cites work

• scientific article; zbMATH DE number 1246635 (Why is no real title available?)
• scientific article; zbMATH DE number 1033560 (Why is no real title available?)
• scientific article; zbMATH DE number 1947377 (Why is no real title available?)
• scientific article; zbMATH DE number 1501063 (Why is no real title available?)
• scientific article; zbMATH DE number 1830721 (Why is no real title available?)
• Algorithms – ESA 2004
• Data Structures for Mobile Data
• Indexing moving points
• Kinetic connectivity for unit disks
• Kinetic dictionaries: how to shoot a moving target
• Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
• Lower bounds for kinetic planar subdivisions
• Maintaining approximate extent measures of moving points
• Maintaining the extent of a moving point set
• On ray shooting in convex polytopes
• Reporting points in halfspaces

Cited in

(5)

• Kinetic sorting and kinetic convex hulls
• Complexity analysis and performance of double hashing sort algorithm
• Lower bounds for kinetic planar subdivisions
• Kinetic dictionaries: how to shoot a moving target
• Soft kinetic data structures

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)