Login / Signup

A packing algorithm for non-manhattan hexagon/triangle placement design by using an adaptive o-tree representation.

Jing LiTan YanBo YangJuebang YuChunhui Li
Published in: DAC (2004)
Keyphrases
  • tree representation
  • dynamic programming
  • optimal solution
  • np hard
  • matching algorithm
  • packing problem
  • objective function
  • tree structure
  • database systems
  • computational complexity
  • multi dimensional
  • binary tree