Smallest paths in simple rectilinear polygons

Abstract

A smallest path between two points is a rectilinear path that simultaneously minimizes distance and the number of horizontal and vertical line segments in the path. Potential applications of smallest rectilinear paths include the simultaneous minimization of vias and wire lengths in two-layer chips, optimization of routes for robots, and the planning of… (More)
DOI: 10.1109/43.144850

Topics

  • Presentations referencing similar topics