The widest k-dense corridor problems

DOI10.1016/S0020-0190(98)00130-6zbMath0925.68433OpenAlexW1985491096MaRDI QIDQ1274672

Chan-Su Shin, Kyung-Yong Chwa, Sung Yong Shin

Publication date: 12 January 1999

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00130-6

zbMATH Keywords

Computational geometryArrangementGeometric dualityCorridorsLevels

Mathematics Subject Classification ID

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

Related Items (7)

An efficient \(k\) nearest neighbors searching algorithm for a query line. ⋮ LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS ⋮ Dynamically maintaining the widest \(k\)-dense corridor ⋮ Locating an obnoxious plane ⋮ Improved algorithm for the widest empty 1-corner corridor ⋮ Improved Algorithm for a Widest 1-Corner Corridor ⋮ The widest k-dense corridor problems

Cites Work

• Unnamed Item
• The widest k-dense corridor problems
• Applications of random sampling in computational geometry. II
• The K-dense corridor problems

This page was built for publication: The widest k-dense corridor problems