Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments

DOI10.1007/3-540-58218-5_24zbMath1502.68338OpenAlexW39904274MaRDI QIDQ5054766

Leonidas Palios

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58218-5_24

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Priority Search Trees
• How to play bowling in parallel on the grid

This page was built for publication: Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments