An optimal algorithm for finding the separation of simple polygons
From MaRDI portal
Publication:5060097
DOI10.1007/3-540-57155-8_235zbMath1504.68244OpenAlexW1530678548MaRDI QIDQ5060097
Publication date: 18 January 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-57155-8_235
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Related Items
Cites Work
- Geometric applications of a matrix-searching algorithm
- Parallel algorithms for some functions of two convex polygons
- Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
- Computing the extreme distances between two convex polygons
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item