On embedding an outer-planar graph in a point set-Reference-Cited by-同舟云学术

On embedding an outer-planar graph in a point set

Published:2002-11 Issue:3 Volume:23 Page:303-312
ISSN:0925-7721
Container-title:Computational Geometry
language:en
Short-container-title:Computational Geometry

Author:

Bose Prosenjit

Publisher

Elsevier BV

Subject

Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications

Reference20 articles.

1. Proximity constraints and representable trees;Bose,1995

2. Characterizing proximity trees;Bose;Algorithmica,1996

3. Graph Theory with Applications;Bondy,1976

4. P. Bose, M. McAllister, J. Snoeyink, Optimal algorithms to embed trees in a point set, J. Graph Algorithms Appl., to appear. Also appears in: Proc. Graph Drawing GD'95, in: Lecture Notes in Computer Science, Vol. 1027, 1995, pp. 64–75

5. On the convex layers of a planar set;Chazelle;IEEE Trans. Inform. Theory,1985

Cited by 71 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A linear-time approximation algorithm for the minimum-length geometric embedding of trees;Optimization;2024-04-03

2. On 1-Bend Upward Point-Set Embeddings of st-Digraphs;Lecture Notes in Computer Science;2024

3. Universal geometric graphs;Combinatorics, Probability and Computing;2023-05-15

4. A heuristic algorithm for straight-line embedding of a hamiltonian cycle onto a given set of points inside simple polygons;2022-10-18

5. Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane;Journal of Combinatorial Optimization;2022-01-27