16 Jun
2013
16 Jun
'13
12:08 p.m.
Hi Alex,
thanks really a lot, i didn't expect a so fast answer, mine was more a
suggestion :)
Anyway tomorrow at work I will be able to access again to the model I was
using and I will let you know about the performances.
Cheers,
Fabrizio
2013/6/14 Alexandre Bergel <alexandre.bergel(a)me.com>
Hi Fabrizio,
Can you try again?
It should be significantly faster, even though we are still rendering
elements that are not visible.
Cheers,
Alexandre
On Jun 14, 2013, at 5:41 AM, Fabrizio Perin <fabrizio.perin(a)gmail.com>
wrote:
--
www.tudorgirba.com
"We cannot reach the flow of things unless we let go."
_______________________________________________
Moose-dev mailing list
Moose-dev(a)iam.unibe.ch
https://www.iam.unibe.ch/mailman/listinfo/moose-dev
_______________________________________________
Moose-dev mailing list
Moose-dev(a)iam.unibe.ch
https://www.iam.unibe.ch/mailman/listinfo/moose-dev
--
_,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:
Alexandre Bergel http://www.bergel.eu
^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;.
_______________________________________________
Moose-dev mailing list
Moose-dev(a)iam.unibe.ch
https://www.iam.unibe.ch/mailman/listinfo/moose-dev
Hi,
to have fast algorithms to layout the elements is very good, but a
visualization
that opens in 1 second but that I cannot touch is useless. I
tried to open a name cloud visualization on a group with 21300 elements,
the visulization take just few seconds to open up but than even to display
a popup window with a mouse over an element take seconds. Not to mention
that I cannot scroll the view or I have to wait minutes sometimes.
The same visulization opened with a MOViewRenderer was nice and easy to
interact
with and to browse.
So, my point is that the priority is absolutly to make roassal more
scalable in
term of interaction and not in term of initial rendering.
Cheers,
Fabrizio
2013/6/8 Tudor Girba <tudor(a)tudorgirba.com>
n log(n) sounds quite good for this kind of algorithm. But, what does n
mean? Is
it the amount of nodes, or the amount of edges as well?
Doru
On Jun 7, 2013, at 6:18 PM, Alexandre Bergel <alexandre.bergel(a)me.com>
wrote:
> Hi Mathieu,
>
> We will have a look at this asap
>
> Alexandre
>
>
> On Jun 7, 2013, at 9:19 AM, mathieubmddehouck(a)mailoo.org wrote:
>
>> Hi
>>
>> I've made some tests on the force based layout, and it seems it has
really a complexity in nlog(n) (and we cannot do really better).
>>
>> Thus when you take 3 seconds to compute a layout with 100 nodes, then
it's normal to take 40 seconds with 1000 nodes.
Regards
Mathieu
_______________________________________________
Moose-dev mailing list
Moose-dev(a)iam.unibe.ch
https://www.iam.unibe.ch/mailman/listinfo/moose-dev
--
_,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:
Alexandre Bergel http://www.bergel.eu
^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;.
_______________________________________________
Moose-dev mailing list
Moose-dev(a)iam.unibe.ch
https://www.iam.unibe.ch/mailman/listinfo/moose-dev