Referenced Items are not available for this document.
Provide a utilising concave vertex to divided layout polygon for solving rectangle NFP problem. The convexity and concavity of polygon vertices was determined by their coordinates, then divide layout polygon into different feasible regions by concave vertex's edges and the unfeasible region will be deleted, offset the feasible region's vertex and gain the rectangle NFP. This method can be used for rectangle layout problem easily and directly. It is simple and efficient by analysis and some examples test and it has wide application in theory and practice.
Published in:
Computer Science and Network Technology (ICCSNT), 2011 International Conference on
(Volume:3
)
Date of Conference: 24-26 Dec. 2011
- Page(s):
- 1625 - 1628
- Print ISBN:
- 978-1-4577-1586-0
- INSPEC Accession Number:
- 12689001
- Conference Location :
- Harbin
- Digital Object Identifier :
- 10.1109/ICCSNT.2011.6182277
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
