An O(log log n) algorithm to compute the kernel of a polygon

DOI10.1007/3-540-58218-5_29zbMath1502.68343OpenAlexW2113337680MaRDI QIDQ5054771

Sven Schuierer

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_29

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Cites Work

• An Optimal Algorithm for Finding the Kernel of a Polygon
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An O(log log n) algorithm to compute the kernel of a polygon