Kinetic connectivity for unit disks

DOI10.1007/S00454-001-0015-1zbMATH Open0984.68174OpenAlexW2080570254MaRDI QIDQ5939471FDOQ5939471

Authors: Leonidas Guibas, John Hershberger, Subhash Suri, Li Zhang 

Publication date: 14 May 2002

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-001-0015-1

Recommendations

• Simplified kinetic connectivity for rectangles and hypercubes
• A kinetic triangulation scheme for moving points in the plane
• scientific article; zbMATH DE number 1830722
• A kinetic triangulation scheme for moving points in the plane
• Soft kinetic data structures

Mathematics Subject Classification ID

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

Cited In (12)

• Dynamic connectivity in disk graphs
• Kinetic facility location
• Kinetic and dynamic data structures for convex hulls and upper envelopes
• Title not available (Why is that?)
• Connectivity graphs as models of local interactions
• Theoretical Aspects of Graph Models for MANETs
• Kinetic sorting and kinetic convex hulls
• Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead
• Semi-dynamic connectivity in the plane
• Simplified kinetic connectivity for rectangles and hypercubes
• Dynamic connectivity in disk graphs
• Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points

This page was built for publication: Kinetic connectivity for unit disks

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