By Topic

Smallest paths in simple rectilinear polygons

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
K. M. McDonald ; Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada ; J. G. Peters

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 traffic routes in cities with gridlike road systems. The existence of a smallest path between any pair of points in a simple rectilinear polygon with n boundary segments is proven and an optimal O(n) time sequential algorithm for finding the smallest paths is presented. An O(log n) parallel algorithm for an n processor CREW PRAM is described

Published in:

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  (Volume:11 ,  Issue: 7 )