Embedding Plane 3-Trees in ℝ2 and ℝ3

DOI10.1007/978-3-642-25878-7_5zbMath1311.68114OpenAlexW2295195288MaRDI QIDQ3223942

Stephane Durocher, Md. Saidur Rahman, Rahnuma Islam Nishat, Debajyoti Mondal, S. H. Whitesides

Publication date: 9 March 2012

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25878-7_5

Mathematics Subject Classification ID

Trees (05C05) 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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Point-set embeddings of plane \(3\)-trees, Universal point sets for planar three-trees, Plane 3-Trees: Embeddability and Approximation

Cites Work

• Unnamed Item
• Quasi-optimal upper bounds for simplex range searching and new zone theorems
• On embedding an outer-planar graph in a point set
• Embedding stacked polytopes on a polynomial-size grid
• IMPROVED ALGORITHMS FOR THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE 3-TREES
• CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS
• Point-Set Embeddings of Plane 3-Trees
• 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
• Embedding planar graphs at fixed vertex locations