Semi-dynamic Connectivity in the Plane

DOI10.1007/978-3-319-21840-3_10zbMath1444.68275arXiv1502.03690OpenAlexW2962803521MaRDI QIDQ3449810

Michael Kerber, Sergio Cabello

Publication date: 30 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.03690

Mathematics Subject Classification ID

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

Related Items (2)

Two optimization problems for unit disks ⋮ Soft Subdivision Search in Motion Planning, II: Axiomatics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Professional advice
• Amortized Analysis of Smooth Quadtrees in All Dimensions
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• On soft predicates in subdivision motion planning
• The complexity of separating points in the plane
• Top-Down Analysis of Path Compression
• Planning Algorithms

This page was built for publication: Semi-dynamic Connectivity in the Plane