HI Jatin
I assume you're referring to an enclosing rectangle rotated to
minimize its area - yes ?
Here is an old but still very nice explanation of an algorithm to do
that with a demo applet:
http://cgm.cs.mcgill.ca/~orm/maer.html
Michael
___
Hi,
if someone need a Minimum Enclosure implementation that can be plugged
into JTS you can find one at
http://www.keepintech.it/files/minimumenclosure.zip
The implementation I made, is a port of minimum area rectangle
algorithm as found in http://www.geometrictools.com/
The comments
Hi Sandro,
Many thanks for the code !
I've just had a quick look at your code and tried it out with some
randomly generated convex polygons If found a couple of little
problems...
In the Vector2 class, I think you want to make those public final
fields static members:
private static
Sandro,
Here's a little demo app for your code. It displays a random convex
polygon and the associated MER. Click on the display panel to
generate new polygons.
Michael
package jtsdemos.minimumenclosure;
import com.vividsolutions.jts.algorithm.ConvexHull;
import
Well, this was never a design constraint on the Polygonizer, so this is
neither a feature nor a bug. It is a bit surprising, however - I think
all the code in the Polygonizer is deterministic, so the output should
be identical for identical input.
If you want a consistent ordering you can
Thanks Aron - I'm looking at it now.
Also, thanks, Alvaro, I hadn't found that, even after a search of this
list's archives.
-r
On Fri, May 29, 2009 at 1:39 AM, Aron Olsen (ARO)
aron.ol...@grontmij-carlbro.dk wrote:
Hi there,
Here is some code I have produced to perform splitting of
Hi Martin,
Normalizing works fine - every time it generates exactly same output
(from the same input).
Thanks,
Janusz
-Original Message-
From: jts-devel-boun...@lists.jump-project.org
[mailto:jts-devel-boun...@lists.jump-project.org] On Behalf Of Martin
Davis
Sent: Friday, June 05, 2009
