Isbn: 9786131296499 - planar straight-line graph: computational geometry, graph embedding (3 resultados)

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -High Quality Content by WIKIPEDIA articles! Planar straight-line graph (PSLG) is a term used in computational geometry for an embedding of a planar graph in the plane such that its edges are mapped into straight line segments. Fáry's theorem (1948) states that every planar graph has this kind of embedding. In computational geometry PSLGs have often been called planar subdivisions, with an assumption or assertion that subdivisions are polygonal. A PSLG without vertices of degree 1 defines a subdivision of the plane into polygonal regions and vice versa. The absence of vertices of degree 1 simplifies descriptions of various algorithms, but it is not essential. PSLGs may serve as representations of various maps, e.g., geographical maps in geographical information systems. Special cases of PSLGs are triangulations (polygon triangulation, point set triangulation). Point set triangulations are maximal PSLGs in the sense that it is impossible to add straight edges to them. Triangulations have numerous applications in various areas. 104 pp. Englisch.…

Taschenbuch. Condición: Neu. Planar Straight-Line Graph | Computational Geometry, Graph Embedding | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131296499 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. …

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. Planarstraight-line graph (PSLG) is a term used in computational geometry foran embedding of a planar graph in the plane such that its edges aremapped into straight line segments. Fáry's theorem (1948) states thatevery planar graph has this kind of embedding. In computational geometryPSLGs have often been called planar subdivisions, with an assumption orassertion that subdivisions are polygonal. A PSLG without vertices ofdegree 1 defines a subdivision of the plane into polygonal regions andvice versa. The absence of vertices of degree 1 simplifies descriptionsof various algorithms, but it is not essential. PSLGs may serve asrepresentations of various maps, e.g., geographical maps in geographicalinformation systems. Special cases of PSLGs are triangulations (polygontriangulation, point set triangulation). Point set triangulations aremaximal PSLGs in the sense that it is impossible to add straight edgesto them. Triangulations have numerous applications in various areas.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 104 pp. Englisch.…