Hi Stefan, >Like Matthias (he is still alive ;) I can only think about a minimum >bounding rectangle, that you are speaking of.
I'm still alive for sure! Never have been dead (yet)... There seems to be a bit of confusion about the terminology here. I remember I had a discussion about that with Cécile (I see in the source code that you are referencing her). The term Minimum Bounding Rectangle seems to be widely used for the axis-parallel bounding rectangle only. I also found the term Smallest Enclosing Box for this, as well as some combinations... For the non-axis parallel problem I found the terms Minimum Area Rectangle, Minimum Area Bounding Rectangle, Minium Area Enclosing Rectangle and Smallest Enclosing Box. > >I have done once an implementation of it, which is rather heavy (i.e. >created a new class) as I use it to obtain several other parameters from >it. The code can be found in the MapGen Toolbox for OpenJUMP (note the >special license which is derived from the Apache license) I just had a short look at this class - is there a plugin available that makes use of it? I don't want to nag about your code ;-) but I remember to have seen an algorithm that does not make use of trigonometric functions, and thus is probably faster. I guess I found it in the Numerical Recipes (3rd edition, chapter on Computational Geometry). I cannot confirm this since I have no access to that book right now. Does anyone on this list maybe can look that up? Matthias _______________________________________________ jts-devel mailing list [email protected] http://lists.refractions.net/mailman/listinfo/jts-devel
