Free Delivery Over $100
|
|
|||
|
||||
OverviewHigh Quality Content by WIKIPEDIA articles! In geometry, a polygon can be either convex or concave. A polygon that is not convex is called concave or reentrant. A concave polygon will always have an interior angle with a measure that is greater than 180 degrees. It is possible to cut a concave polygon into a set of convex polygons. A polynomial-time algorithm for finding a decomposition into as few convex polygons as possible is described by Chazelle & Dobkin (1985). Full Product DetailsAuthor: Lambert M. Surhone , Miriam T. Timpledon , Susan F. MarsekenPublisher: VDM Publishing House Imprint: VDM Publishing House Dimensions: Width: 22.90cm , Height: 0.60cm , Length: 15.20cm Weight: 0.162kg ISBN: 9786131215742ISBN 10: 613121574 Pages: 102 Publication Date: 13 August 2010 Audience: General/trade , General Format: Paperback Publisher's Status: Active Availability: In Print  This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |
||||
