Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Ordered trees are generally drawn using order-preserving planar straight-line grid drawings.  investigate the area-requirements of such drawings and present several results. Let T be an ordered tree with n nodes.  show that: • T admits an order-preserving planar straight-line grid drawing with O(n log n) area. • If T is a binary tree, then T admits an order-preserving planar straight-line grid drawing with O(n loglog n) area. • If T is a binary tree, then T admits an order-preserving upward planar straight-line grid drawing with optimalO(n log n) area.  also study the problem of drawing binary trees with user-specified aspect ratios.  show that an ordered binary tree T with n nodes admits an order-preserving planar straight-line grid drawing with area O(n log n), and any user-specified aspect ratio in the range [1,n/log n]. All the drawings mentioned above can be constructed in O(n) time.
['Ashim Garg', 'Adrian Rusu']
I am writing a research paper on a idea AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES
[{"from": "human", "value": "I am writing a research paper on a idea AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Ordered trees are generally drawn using order-preserving planar straight-line grid drawings.  investigate the area-requirements of such drawings and present several results. Let T be an ordered tree with n nodes.  show that: \u2022 T admits an order-preserving planar straight-line grid drawing with O(n log n) area. \u2022 If T is a binary tree, then T admits an order-preserving planar straight-line grid drawing with O(n loglog n) area. \u2022 If T is a binary tree, then T admits an order-preserving upward planar straight-line grid drawing with optimalO(n log n) area.  also study the problem of drawing binary trees with user-specified aspect ratios.  show that an ordered binary tree T with n nodes admits an order-preserving planar straight-line grid drawing with area O(n log n), and any user-specified aspect ratio in the range [1,n/log n]. All the drawings mentioned above can be constructed in O(n) time."}]