On embedding an outer-planar graph in a point set
- 1 November 2002
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 23 (3) , 303-312
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Area requirement of visibility representations of treesInformation Processing Letters, 1997
- Characterizing proximity treesAlgorithmica, 1996
- Proximity constraints and representable trees (extended abstract)Lecture Notes in Computer Science, 1995
- Optimal-area upward drawings of AVL trees1995
- Algorithms for drawing graphs: an annotated bibliographyComputational Geometry, 1994
- The rooted tree embedding problem into points in the planeDiscrete & Computational Geometry, 1994
- Applications of a semi-dynamic convex hull algorithmBIT Numerical Mathematics, 1992
- E3341The American Mathematical Monthly, 1991
- On the convex layers of a planar setIEEE Transactions on Information Theory, 1985
- Maintenance of configurations in the planeJournal of Computer and System Sciences, 1981