Constrained point set embedding of a balanced binary tree

DOI10.1142/S0129054115500112zbMATH Open1322.68144OpenAlexW2142909216MaRDI QIDQ5261607FDOQ5261607

Alireza Bagheri, Fatemeh Rajabi-Alni

Publication date: 6 July 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054115500112

Recommendations

• Point-Set Embedding of Trees with Edge Constraints
• Planar embedding of trees on point sets without the general position assumption
• Point-set embeddings of trees with given partial drawings
• Optimal Algorithms to Embed Trees in a Point Set
• Constrained Point-Set Embeddability of Planar Graphs

zbMATH Keywords

straight skeletonsimple polygonpoint-set embeddingbalanced binary treebounded point set

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)

Cites Work

• Optimal Algorithms to Embed Trees in a Point Set
• Embedding planar graphs at fixed vertex locations
• Point-set embeddings of trees with given partial drawings
• On embedding an outer-planar graph in a point set
• The rooted tree embedding problem into points in the plane
• 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 a straight-line embedding problem of graphs
• On the thickness of graphs of given degree
• Drawing complete binary trees inside rectilinear polygons

Cited In (1)

• Degree constrained tree embedding into points in the plane

This page was built for publication: Constrained point set embedding of a balanced binary tree

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