Counting Rectangular Drawings or Floorplans in Polynomial Time.
Youhei InoueToshihiko TakahashiRyo FujimakiPublished in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2009)
Keyphrases
- special case
- line drawings
- worst case
- approximation algorithms
- search engine
- computational complexity
- engineering drawings
- database
- real world
- lower bound
- packing problem
- bounded treewidth
- guillotine cutting
- convex quadratic optimization
- symbol recognition
- polynomial time complexity
- np complete
- search space
- object recognition
- information retrieval
- data sets