|
|
|||
|
||||
OverviewIn this thesis we consider degree sequences of triangulations of point sets in convex position in the plane. This is equivalent to degree sequences of maximal outerplanar graphs. Utilizing basic properties as well as new relations for triangulations we develop sufficient and necessary conditions for special cases of nonnegative integer sequences to be valid degree sequences of a triangulation of a convex point set. This includes the more general cases where we have more 'big nodes' (nodes with degree greater than 2) than nodes with degree 0 (ears). Also for this case we present sufficient and necessary conditions for a sequence to be a degree sequence. Additionally, we present algorithmic constructions of canonical triangulations for all discussed cases. Full Product DetailsAuthor: Markus KügerlPublisher: AV Akademikerverlag Imprint: AV Akademikerverlag Dimensions: Width: 15.20cm , Height: 0.70cm , Length: 22.90cm Weight: 0.168kg ISBN: 9783639457605ISBN 10: 3639457609 Pages: 108 Publication Date: 22 May 2013 Audience: General/trade , General Format: Paperback Publisher's Status: Active Availability: In stock We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |