C. O'Dunlaing

• A tight lower bound for the complexity of path-planning for a disc
• Counting digraphs and hypergraphs
• Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagram
• Generalized Voronoi diagrams for moving a ladder: I. Topological analysis
• The Voronoi methods for motion-planning: I. The case of a disc
• Generalized Voronoi Diagrams for Moving a Ladder