Constrained Point-Set Embeddability of Planar Graphs

DOI10.1007/978-3-642-00219-9_35MaRDI QIDQ3611871zbMATH OpenOpenAlexFDO

Authors Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, S. Wismath

Publication date 3 March 2009

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00219-9_35

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Constrained point-set embeddability of planar graphs
• Point-set embeddings of trees with given partial drawings
• Point-Set Embedding of Trees with Edge Constraints
• Curve-constrained drawings of planar graphs
• Drawing planar graphs on a curve.

Cites work

• scientific article; zbMATH DE number 431516 (Why is no real title available?)
• Curve-constrained drawings of planar graphs
• Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge
• Drawing colored graphs on colored points
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Embedding planar graphs at fixed vertex locations
• Graph Drawing and Applications for Software and Knowledge Engineers
• ON EMBEDDING A GRAPH ON TWO SETS OF POINTS
• On embedding an outer-planar graph in a point set
• On the thickness of graphs of given degree
• Optimal Algorithms to Embed Trees in a Point Set
• Point-Set Embedding of Trees with Edge Constraints
• SEMI-BALANCED PARTITIONS OF TWO SETS OF POINTS AND EMBEDDINGS OF ROOTED FORESTS
• Straight line embeddings of rooted star forests in the plane
• The rooted tree embedding problem into points in the plane
• k-colored Point-set Embeddability of Outerplanar Graphs

Cited in

(18)

• Constrained point set embedding of a balanced binary tree
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Drawing graphs with vertices at specified positions and crossings at large angles
• Constrained independence system and triangulations of planar point sets
• On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs
• Constrained point-set embeddability of planar graphs
• Drawing planar graphs on a curve.
• Bounded Embeddings of Graphs in the Plane
• On point set embeddings for k-planar graphs with few bends per edge
• Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
• Point-Set Embedding of Trees with Edge Constraints
• Drawing planar graphs on points inside a polygon
• Embedding planar graphs at fixed vertex locations
• Kinetic and Stationary Point-Set Embeddability for Plane Graphs
• Curve-constrained drawings of planar graphs
• EMBEDDING POINT SETS INTO PLANE GRAPHS OF SMALL DILATION
• Graphs embedded in the plane with a bounded number of accumulation points
• Manhattan-geodesic embedding of planar graphs

This page was built for publication: Constrained Point-Set Embeddability of Planar Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611871)