An O(n log n) Manhattan path algorithm
Information Processing Letters
Fast Search Algorithms for Associative Memories
IEEE Transactions on Computers
Bulletin of Centre for Informatics
Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles
IEEE Transactions on Computers
Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) time
SCG '87 Proceedings of the third annual symposium on Computational geometry
A method for gridless routing of printed circuit boards
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
Algorithms for Parallel-Search Memories
Journal of the ACM (JACM)
Contentaddressable Memories
A line-expansion algorithm for the general routing problem with a guaranteed solution
DAC '80 Proceedings of the 17th Design Automation Conference
Reconfigurable machine and its application to logic diagnosis
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Hi-index | 0.01 |
A new gridless router accelerated by Content Addressable Memory (CAM) is presented. A gridless version of the line-expansion algorithm is implemented, which always finds a path if one exists. The router runs in linear time by means of the CAM-based accelerator. Experimental results show that the more obstacles there are in the routing region, the more effective the CAM-based approach is.