Kinetic and dynamic data structures for convex hulls and upper envelopes
From MaRDI portal
Publication:857064
DOI10.1016/J.COMGEO.2006.01.002zbMATH Open1106.65014OpenAlexW1977401387MaRDI QIDQ857064FDOQ857064
Authors: Giora Alexandron, Haim Kaplan, Micha Sharir 
Publication date: 14 December 2006
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2006.01.002
Recommendations
Data structures (68P05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Title not available (Why is that?)
- Improved bounds for planar \(k\)-sets and related problems
- Maintenance of configurations in the plane
- Discrete mobile centers
- Data Structures for Mobile Data
- Randomized search trees
- Title not available (Why is that?)
- Point sets with many \(k\)-sets
- Kinetic collision detection between two simple polygons.
- Title not available (Why is that?)
- Maintaining the extent of a moving point set
- Static and kinetic geometric spanners with applications
- KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
- Cylindrical static and kinetic binary space partitions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Kinetic connectivity for unit disks
- Kinetic collision detection with fast flight plan changes
- Lower bounds for kinetic planar subdivisions
- Simplified kinetic connectivity for rectangles and hypercubes
- Soft kinetic data structures
- Kinetic dictionaries: how to shoot a moving target
Cited In (19)
- Kinetic sorting and kinetic convex hulls
- Out-of-order event processing in kinetic data structures
- Kinetic collision detection with fast flight plan changes
- Algorithms and Data Structures
- Dynamic geometric data structures via shallow cuttings
- Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model
- A simple, faster method for kinetic proximity problems
- Kinetic sorting and kinetic convex hulls
- Kinetic convex hulls and Delaunay triangulations in the black-box model
- Kinetic Euclidean minimum spanning tree in the plane
- Kinetic and dynamic data structures for closest pair and all nearest neighbors
- Title not available (Why is that?)
- Agglomerative clustering of growing squares
- 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
- Kinetic heap-ordered trees: Tight analysis and improved algorithms
- Robust Kinetic Convex Hulls in 3D
- Maintaining the extent of a moving point set
This page was built for publication: Kinetic and dynamic data structures for convex hulls and upper envelopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857064)
