Call Us 080-41656200 (Mon-Sat: 10AM-8PM)
Free Shipping above Rs. 1499
Cash On Delivery*

Degree Sequences of Triangulations of Convex Point Sets


Marketed By :  AV Akademikerverlag   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days


Check Your Delivery Options

Rs. 2,973

Availability: In stock

  • Product Description

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.

Product Specifications
SKU :COC67957
AuthorMarkus Kügerl
Number of Pages108
Publishing Year2013-05-22T00:00:00.000
Edition1 st
Book TypeGeometry
Country of ManufactureIndia
Product BrandAV Akademikerverlag
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-07-08 00:00:00