Efficient algorithms for shortest distance queries on special classes of polygons
From MaRDI portal
Publication:673766
DOI10.1016/0304-3975(94)00195-OzbMath0874.68266MaRDI QIDQ673766
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
93C85: Automated systems (robots, etc.) in control theory
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Recognizing visibility graphs of spiral polygons
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Perfect Graphs and Orthogonally Convex Covers
- Dominating Sets in Chordal Graphs