/*
* The Unified Mapping Platform (JUMP) is an extensible, interactive GUI
* for visualizing and manipulating spatial features with geometry and attributes.
*
* Copyright (C) 2003 Vivid Solutions
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
* For more information, contact:
*
* Vivid Solutions
* Suite #1A
* 2328 Government Street
* Victoria BC V8T 5G5
* Canada
*
* (250)385-6040
* www.vividsolutions.com
*/
package com.vividsolutions.jump.workbench.ui.renderer.java2D;
import java.awt.Rectangle;
import java.awt.Shape;
import java.awt.geom.AffineTransform;
import java.awt.geom.GeneralPath;
import java.awt.geom.NoninvertibleTransformException;
import java.awt.geom.PathIterator;
import java.awt.geom.Point2D;
import java.awt.geom.Rectangle2D;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Iterator;
import com.vividsolutions.jts.geom.Coordinate;
import com.vividsolutions.jts.geom.GeometryFactory;
import com.vividsolutions.jts.geom.LineString;
import com.vividsolutions.jump.workbench.ui.renderer.java2D.Java2DConverter.LineStringPath;
// Converted PolygonShape from java.awt.Polygon to GeneralPath
// for more accurate (float instead of int) rendering.
// From larry becker's SkyJUMP code to OpenJUMP [mmichaud]
public class PolygonShape implements Shape {
private GeneralPath shell;
private ArrayList holes = new ArrayList();
public PolygonShape(){
shell = null;
holes = null;
}
/**
* @param shellVertices in view coordinates
* @param holeVerticesCollection a Coordinate[] for each hole, in view coordinates
*/
public PolygonShape(Coordinate[] shellVertices,
Collection holeVerticesCollection) {
shell = toPolygon(shellVertices);
for (Iterator i = holeVerticesCollection.iterator(); i.hasNext();) {
Coordinate[] holeVertices = (Coordinate[]) i.next();
holes.add(toPolygon(holeVertices));
}
}
class PolygonPath implements PathIterator {
private int iterate;
private int numPoints;
private Coordinate[] points;
public PolygonPath(Coordinate[] coordinates){
points = coordinates;
this.numPoints = points.length;
iterate = 0;
}
private int getSegType(){
// Tip from Larry Becker to have nice JOIN_BEVEL 2007-07-13 [mmichaud]
if (iterate == numPoints-1)
return PathIterator.SEG_CLOSE;
return (iterate==0) ? PathIterator.SEG_MOVETO : PathIterator.SEG_LINETO;
}
public int currentSegment(double[] coords) {
coords[0] = points[iterate].x;
coords[1] = points[iterate].y;
return getSegType();
}
public int currentSegment(float[] coords) {
coords[0] = (float) points[iterate].x;
coords[1] = (float) points[iterate].y;
return getSegType();
}
public int getWindingRule() {
return GeneralPath.WIND_EVEN_ODD;
}
public boolean isDone() {
return !(iterate < numPoints);
}
public void next() {
iterate++;
}
}
public final GeneralPath toPolygon(Coordinate[] coordinates) {
int numPoints = coordinates.length;
GeneralPath shape = new GeneralPath(GeneralPath.WIND_EVEN_ODD, numPoints);
PathIterator pi = new PolygonPath(coordinates);
shape.append(pi,false);
return shape;
// GeneralPath shape = new GeneralPath(GeneralPath.WIND_EVEN_ODD, numPoints);
// shape.moveTo((float) coordinates[0].x, (float) coordinates[0].y);
// for (int i = 1; i < numPoints; i++) {
// shape.lineTo((float) coordinates[i].x, (float) coordinates[i].y);
// }
// return shape;
// java.awt.Polygon polygon = new java.awt.Polygon();
//
// for (int i = 0; i < coordinates.length; i++) {
// polygon.addPoint((int) coordinates[i].x, (int) coordinates[i].y);
// }
//
// return polygon;
}
/*
private java.awt.Polygon toPolygon(Coordinate[] coordinates) {
java.awt.Polygon polygon = new java.awt.Polygon();
for (int i = 0; i < coordinates.length; i++) {
polygon.addPoint((int) coordinates[i].x, (int) coordinates[i].y);
}
return polygon;
}
*/
public Rectangle getBounds() {
// LDB: Implemented for printing interface
return shell.getBounds();
}
public Rectangle2D getBounds2D() {
return shell.getBounds2D();
}
public boolean contains(double x, double y) {
/**@todo Implement this java.awt.Shape method*/
throw new java.lang.UnsupportedOperationException(
"Method contains() not yet implemented.");
}
public boolean contains(Point2D p) {
/**@todo Implement this java.awt.Shape method*/
throw new java.lang.UnsupportedOperationException(
"Method contains() not yet implemented.");
}
public boolean intersects(double x, double y, double w, double h) {
/**@todo Implement this java.awt.Shape method*/
throw new java.lang.UnsupportedOperationException(
"Method intersects() not yet implemented.");
}
public boolean intersects(Rectangle2D r) {
/**@todo Implement this java.awt.Shape method*/
throw new java.lang.UnsupportedOperationException(
"Method intersects() not yet implemented.");
}
public boolean contains(double x, double y, double w, double h) {
/**@todo Implement this java.awt.Shape method*/
throw new java.lang.UnsupportedOperationException(
"Method contains() not yet implemented.");
}
public boolean contains(Rectangle2D r) {
/**@todo Implement this java.awt.Shape method*/
throw new java.lang.UnsupportedOperationException(
"Method contains() not yet implemented.");
}
public PathIterator getPathIterator(AffineTransform at) {
ArrayList rings = new ArrayList();
rings.add(shell);
rings.addAll(holes);
return new ShapeCollectionPathIterator(rings, at);
}
public PathIterator getPathIterator(AffineTransform at, double flatness) {
// since we don't support curved geometries, can simply delegate to the simple method
return getPathIterator(at);
}
}