Dynamically maintaining the widest \(k\)-dense corridor

DOI10.1016/S0304-3975(00)00370-4zbMath0974.68218MaRDI QIDQ5941092

Tetsuo Asano, Tomohiro Harayama, Subhas C. Nandy

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

corridorsgeometric dualitylevels of arrangement

Mathematics Subject Classification ID

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

Related Items (3)

Improved algorithm for the widest empty 1-corner corridor ⋮ Improved Algorithm for a Widest 1-Corner Corridor ⋮ SMALLEST COLOR-SPANNING OBJECT REVISITED

Cites Work

• The widest k-dense corridor problems
• The K-dense corridor problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Dynamically maintaining the widest \(k\)-dense corridor