Theory and application of width bounded geometric separators

DOI10.1016/j.jcss.2010.05.003zbMath1219.68158MaRDI QIDQ632801

Bin Fu

Publication date: 28 March 2011

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2010.05.003

zbMATH Keywords

divide and conquer; disk covering; width bounded separator

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)