CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS
From MaRDI portal
Publication:3063657
DOI10.1142/S021819591000344XzbMath1213.65033OpenAlexW2133642716WikidataQ62042513 ScholiaQ62042513MaRDI QIDQ3063657
Giuseppe Liotta, Emilio Di Giacomo, Walter Didimo, Stephen K. Wismath, Henk G. Meijer
Publication date: 15 December 2010
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s021819591000344x
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity and performance of numerical algorithms (65Y20)
Related Items (4)
Embedding Plane 3-Trees in ℝ2 and ℝ3 ⋮ 2-colored point-set embeddings of partial 2-trees ⋮ 2-colored point-set embeddings of partial 2-trees ⋮ THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS
Cites Work
- Curve-constrained drawings of planar graphs
- How to draw a planar graph on a grid
- Point-set embeddings of trees with given partial drawings
- Drawing colored graphs on colored points
- Drawing colored graphs with constrained vertex positions and few bends per edge
- On the thickness of graphs of given degree
- The rooted tree embedding problem into points in the plane
- On embedding an outer-planar graph in a point set
- Straight line embeddings of rooted star forests in the plane
- A Visibility Representation for Graphs in Three Dimensions
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- ON EMBEDDING A GRAPH ON TWO SETS OF POINTS
- SEMI-BALANCED PARTITIONS OF TWO SETS OF POINTS AND EMBEDDINGS OF ROOTED FORESTS
- Embedding planar graphs at fixed vertex locations
This page was built for publication: CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS
