Category
Geometry
Store
Wordery
Brand
Av akademikerverlag
Degree Sequences of Triangulations of Convex Point Sets : 9783639457605 : 22 May 2013 : In 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.
39.5 GBP
Recommendations
Choose your language and region
Klarna is available around the world with a variable offering, choose one that suits you best.
Copyright © 2005-2024 Klarna Bank AB (publ). Headquarters: Stockholm, Sweden. All rights reserved. Klarna Bank AB (publ). Sveavägen 46, 111 34 Stockholm. Organization number: 556737-0431