Efficient algorithms for shortest distance queries on special classes of polygons

DOI10.1016/0304-3975(94)00195-OzbMath0874.68266MaRDI QIDQ673766

Juan-Miguel Gracia

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

rectilinear minimum bend path

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Unified all-pairs shortest path algorithms in the chordal hierarchy

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient algorithms for shortest distance queries on special classes of polygons