{"product_id":"constrained-graph-layouts-vertices-on-the-outer-face-and-on-the-integer-grid-von-andre-loffler","title":"Constrained Graph Layouts","description":"Constraining graph layouts - that is, restricting the placement of vertices and the routing of edges to obey certain constraints - is common practice in graph drawing.\nIn this book, we discuss algorithmic results on two different restriction types: placing vertices on the outer face and on the integer grid.\nFor the first type, we look into the outer k-planar and outer k-quasi-planar graphs, as well as giving a linear-time algorithm to recognize full and closed outer k-planar graphs Monadic Second-order Logic.\nFor the second type, we consider the problem of transferring a given planar drawing onto the integer grid while perserving the original drawings topology; we also generalize a variant of Cauchy's rigidity theorem for orthogonal polyhedra of genus 0 to those of arbitrary genus.\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783958261464\"\u003e\u003ch3\u003eVertices on the Outer Face and on the Integer Grid\u003c\/h3\u003e\u003c\/div\u003e","brand":"Libri","offers":[{"title":"Softcover - 9783958261464","offer_id":39458912436317,"sku":"9783958261464","price":32.9,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/e1fdc66c-c2e0-43ca-9765-33a1aaedec5e.jpg?v=1769924893","url":"https:\/\/shop.autorenwelt.de\/products\/constrained-graph-layouts-vertices-on-the-outer-face-and-on-the-integer-grid-von-andre-loffler","provider":"Autorenwelt Shop","version":"1.0","type":"link"}