Fast algorithms for one-dimensionsal compaction with jog insertion

DOI10.1007/3-540-57155-8_282MaRDI QIDQ5060150zbMATH OpenOpenAlexFDO

Authors Matthias F. M. Stallmann, Thomas A. Hughes

Publication date 18 January 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57155-8_282

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• A faster one-dimensional topological compaction algorithm with jog insertion
• Routing through a Dense Channel with Minimum Total Wire Length
• A generic algorithm for one-dimensional homotopic compaction
• scientific article; zbMATH DE number 3894985
• scientific article; zbMATH DE number 3898776

Cites work

• An O(n\log \log n)-Time Algorithm for Triangulating a Simple Polygon
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• On the solution of inequality systems relevant to IC-layout
• Self-adjusting binary search trees

Cited in

(4)

• A framework for 1-D compaction with forbidden region avoidance
• A faster one-dimensional topological compaction algorithm with jog insertion
• Minimum area joining of k compacted cells
• A generic algorithm for one-dimensional homotopic compaction

This page was built for publication: Fast algorithms for one-dimensionsal compaction with jog insertion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060150)