From mboxrd@z Thu Jan 1 00:00:00 1970 X-Msuck: nntp://news.gmane.io/gmane.comp.tex.context/6013 Path: main.gmane.org!not-for-mail From: Marco Kuhlmann Newsgroups: gmane.comp.tex.context Subject: How powerful is mp? Date: Wed, 7 Nov 2001 12:30:24 +0000 Sender: owner-ntg-context@let.uu.nl Message-ID: <20011107123024.A3646@wimsey> NNTP-Posting-Host: coloc-standby.netfonds.no Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: main.gmane.org 1035396565 6515 80.91.224.250 (23 Oct 2002 18:09:25 GMT) X-Complaints-To: usenet@main.gmane.org NNTP-Posting-Date: Wed, 23 Oct 2002 18:09:25 +0000 (UTC) Original-To: ConTeXt ML Xref: main.gmane.org gmane.comp.tex.context:6013 X-Report-Spam: http://spam.gmane.org/gmane.comp.tex.context:6013 Dear list, I am currently re-considering my policy regarding graphics, and would like to have your advice. Up to now, I am using the Functional MetaPost (FMP) front-end to MP, which is quite nice if you want to draw trees according to the generic algorithm proposed by Kennedy (see the paper at http://citeseer.nj.nec.com/kennedy96drawing.html). Well, to be honest: it is mostly therefore that I use FMP. :-) Now my question: Do you think that one can actually write a program in MP/ConTeXt directly that implements Kennedy's algorithm? It should take a structural description of a tree as input (XML seems to be a good choice for the format here) and produce a drawing of the tree as output. The tree structure should be placeable inside a ConTeXt document. Using FMP, the necessary calculations are done in beforehand, and MP already gets the exact measures (distances between nodes, levels etc). This additional algorithmical level I have considered as one of the major advantages of FMP. On the other hand, it needs to be run separately. Cheers, Marco -- Marco Kuhlmann marco.kuhlmann@gmx.net