Constructing maximal slicings from geometry

DOI10.1007/BF00289114MaRDI QIDQ1088412zbMATH OpenOpenAlexFDO

Authors B. George

Publication date 1986

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00289114

zbMATH Keywords

macrosfloorplanninghierarchicial global wiringisothetic non-overlapping rectanglesmaximal slicing treeVLSI custom chip design

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Maximal cuts in arbitrary dimension
• Maximal slicings in spherical symmetry: Local existence and construction
• The geometry of the slice-ribbon problem
• ON RECONSTRUCTING POLYHEDRA FROM PARALLEL SLICES
• Slicing convex sets and measures by a hyperplane
• Slicing convex sets and measures by a hyperplane
• Maximal hyperplane sections of convex bodies
• Geometry of cuts and metrics
• Geometry of cuts and metrics
• The geometry of strict maximality

Cites work

• A note on the modeling space of Euler operators
• Optimal orientations of cells in slicing floorplan designs
• The Recognition of Series Parallel Digraphs

Cited in

(2)

• Complexity and approximability results for slicing floorplan designs.
• Minimum-Area Wiring for Slicing Structures

This page was built for publication: Constructing maximal slicings from geometry

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