From mboxrd@z Thu Jan 1 00:00:00 1970 X-Msuck: nntp://news.gmane.io/gmane.comp.tex.context/6039 Path: main.gmane.org!not-for-mail From: Marco Kuhlmann Newsgroups: gmane.comp.tex.context Subject: Re: How powerful is mp? Date: Thu, 8 Nov 2001 11:16:18 +0000 Sender: owner-ntg-context@let.uu.nl Message-ID: <20011108111618.A853@wimsey> References: <20011107123024.A3646@wimsey> <5.1.0.14.1.20011107183011.04289690@server-1> <20011107174952.A1358@wimsey> <20011108093308.7f315d4e.taco@elvenkind.com> NNTP-Posting-Host: coloc-standby.netfonds.no Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: main.gmane.org 1035396591 6831 80.91.224.250 (23 Oct 2002 18:09:51 GMT) X-Complaints-To: usenet@main.gmane.org NNTP-Posting-Date: Wed, 23 Oct 2002 18:09:51 +0000 (UTC) Original-To: ntg-context@ntg.nl In-Reply-To: <20011108093308.7f315d4e.taco@elvenkind.com> Xref: main.gmane.org gmane.comp.tex.context:6039 X-Report-Spam: http://spam.gmane.org/gmane.comp.tex.context:6039 Taco Hoekwater wrote (2001-11-08 (09:33)): > The PDF of the paper is a TeX document processed with bitmap > fonts. Incredibly ugly thing. The original of the paper is a ps-file. The pdf has been created automatically by citeseer; they do this with every article that they cache. > Kennedy's implementation uses quadratic time. With all respect > for the author himself, I think his article is not very > exciting. I see. I'm afraid I was never really concerned about the complexity, but just found the layout he proposes the best among the tree-drawing algorithms that I know of. :-) Do you happen to know an algorithm with better complexity? > I don't think so. The cleanest way to build trees is bottom > up, which is quite different from the flowchart approach. Okay. Could you point me to some tree-builder which does it bottom up? I definitely want to have a nice tree-drawing algorithm in ConTeXt, even if I have to implement it myself. :-) Marco -- Marco Kuhlmann marco.kuhlmann@gmx.net