Skip to main content



      Home
Home » Eclipse Projects » GEF » Automatic layout size in Zest
Automatic layout size in Zest [message #246815] Fri, 09 January 2009 07:20 Go to next message
Eclipse UserFriend
Originally posted by: csaad.gmx.net

Hi,

I'd like to know wheter there is any possibility to let Zest compute the
optimal size for the layouted graph instead of passing the required size
in the applyLayout() method.
The problem with the specification of a concrete size is that it depends
of the number of elements and the selected layouting algorithm, so it is
not possible to do this automatically without manual adjustments by the
user.

Thanks,
Chris
Re: Automatic layout size in Zest [message #246858 is a reply to message #246815] Wed, 14 January 2009 11:51 Go to previous messageGo to next message
Eclipse UserFriend
Originally posted by: irbull.cs.uvic.ca

C. Saad wrote:
> Hi,
>
> I'd like to know wheter there is any possibility to let Zest compute the
> optimal size for the layouted graph instead of passing the required size
> in the applyLayout() method.

In general, no. Spring algorithms (for example) would continue to push
away forever, if it was not bounded. However, tree based algorithms
could probably be made to work this way.

Can you file an enhancement request under GEF->Zest for this?

> The problem with the specification of a concrete size is that it depends
> of the number of elements and the selected layouting algorithm, so it is
> not possible to do this automatically without manual adjustments by the
> user.
>
> Thanks,
> Chris
>
Re: Automatic layout size in Zest [message #246891 is a reply to message #246858] Thu, 15 January 2009 04:02 Go to previous message
Eclipse UserFriend
Hi Ian,

thanks for your answer. I've entered the request in bugzilla (261163).

Regards,
Chris

Ian Bull wrote:

> C. Saad wrote:
>> Hi,
>>
>> I'd like to know wheter there is any possibility to let Zest compute the
>> optimal size for the layouted graph instead of passing the required size
>> in the applyLayout() method.

> In general, no. Spring algorithms (for example) would continue to push
> away forever, if it was not bounded. However, tree based algorithms
> could probably be made to work this way.

> Can you file an enhancement request under GEF->Zest for this?

>> The problem with the specification of a concrete size is that it depends
>> of the number of elements and the selected layouting algorithm, so it is
>> not possible to do this automatically without manual adjustments by the
>> user.
>>
>> Thanks,
>> Chris
>>
Previous Topic:[Announce] GEF 3.5.0 I200901141304 is available
Next Topic:Divinding a figure
Goto Forum:
  


Current Time: Wed Jul 09 23:38:08 EDT 2025

Powered by FUDForum. Page generated in 0.05867 seconds
.:: Contact :: Home ::.

Powered by: FUDforum 3.0.2.
Copyright ©2001-2010 FUDforum Bulletin Board Software

Back to the top