Optimal Algorithms to Embed Trees in a Point Set

From MaRDI portal
Publication:4381059

DOI10.7155/jgaa.00002zbMath0890.05066OpenAlexW2148367192MaRDI QIDQ4381059

M. McAllister, Jack Scott Snoeyink, Prosenjit Bose

Publication date: 1 April 1998

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00002




Related Items

On triconnected and cubic plane graphs on given point setsUpward Straight-Line Embeddings of Directed Graphs into Point SetsPlane Graphs with Parity ConstraintsPlane bichromatic trees of low degreeOrthogeodesic point-set embedding of treesOptimal point-set embedding of wheel graphs and a sub-class of 3-treesEmbedding Plane 3-Trees in ℝ2 and ℝ3Orthogeodesic Point-Set Embedding of TreesUpward Point Set Embeddability for Convex Point Sets Is in POn embedding triconnected cubic graphs on point setsOn upward point set embeddabilityOn the curve complexity of 3-colored point-set embeddingsPlane graphs with parity constraintsPoint-set embeddings of trees with given partial drawingsCubic plane graphs on a given point setImproved Bounds for Drawing Trees on Fixed Points with L-Shaped EdgesComputing Upward Topological Book Embeddings of Upward Planar DigraphsUpward point set embeddings of paths and trees-shaped point set embeddings of high-degree plane graphsComputing upward topological book embeddings of upward planar digraphsCurve-constrained drawings of planar graphsConstrained Point-Set Embeddability of Planar GraphsUpward Point-Set Embeddability2-colored point-set embeddings of partial 2-trees2-colored point-set embeddings of partial 2-treesPlanar straight-line point-set embedding of trees with partial embeddingsUpward straight-line embeddings of directed graphs into point setsBipartite embeddings of trees in the planePlane 3-Trees: Embeddability and ApproximationConstrained Point Set Embedding of a Balanced Binary TreeOn embedding an outer-planar graph in a point set