Planar straight-line point-set embedding of trees with partial embeddings

DOI10.1016/j.ipl.2010.04.019zbMath1233.68137OpenAlexW1988637831MaRDI QIDQ763547

Mohammadreza Razzazi, Alireza Bagheri

Publication date: 12 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.04.019

zbMATH Keywords

computational complexitycomputational geometrypoint-set embeddinggeometric embeddingconstrained graph drawingpartial drawing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Extending simple drawings ⋮ Inserting one edge into a simple drawing is hard

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Point-set embeddings of trees with given partial drawings
• Drawing colored graphs on colored points
• Bipartite embeddings of trees in the plane
• The rooted tree embedding problem into points in the plane
• On embedding an outer-planar graph in a point set
• Optimal Algorithms to Embed Trees in a Point Set
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
• ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
• Embedding planar graphs at fixed vertex locations

This page was built for publication: Planar straight-line point-set embedding of trees with partial embeddings