Point-Set Embedding of Trees with Edge Constraints
DOI10.1007/978-3-540-77537-9_14zbMATH Open1137.68476OpenAlexW1840234796WikidataQ62042564 ScholiaQ62042564MaRDI QIDQ5452216FDOQ5452216
Authors: Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, S. Wismath 
Publication date: 25 March 2008
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_14
Recommendations
- Point-set embeddings of trees with given partial drawings
- Constrained point-set embeddability of planar graphs
- Constrained Point-Set Embeddability of Planar Graphs
- Improved algorithms for the point-set embeddability problem for plane 3-trees
- Planar embedding of trees on point sets without the general position assumption
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (12)
- Orthogeodesic point-set embedding of trees
- Constrained point-set embeddability of planar graphs
- Planar embedding of trees on point sets without the general position assumption
- Planar straight-line point-set embedding of trees with partial embeddings
- Optimal point-set embedding of wheel graphs and a sub-class of 3-trees
- Orthogeodesic point-set embedding of trees
- Constrained Point-Set Embeddability of Planar Graphs
- Degree constrained tree embedding into points in the plane
- Point-set embeddings of trees with given partial drawings
- On L-shaped point set embeddings of trees: first non-embeddable examples
- Manhattan-geodesic embedding of planar graphs
- Constrained point set embedding of a balanced binary tree
This page was built for publication: Point-Set Embedding of Trees with Edge Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452216)
