Class PolygonSimple
java.lang.Object
com.treemap.swing.fastvoronoi.polygon.PolygonSimple
- All Implemented Interfaces:
com.macrofocus.geom.Shape,Cloneable
Implements a simple polygon with one continous region, by using two double arrays.
-
Field Summary
FieldsModifier and TypeFieldDescriptionprotected doubleprotected com.macrofocus.geom.Rectangle2D.Doubleprotected Point2Dcentroid of the polygon is stored for faster access, once it is computedinty-coordinatesprotected PolygonSimpleStores the orginal polygon result, without shrinkingprotected RandomUsed for generation of a random point in a polygon.protected double[]protected double[]x-coordinates -
Constructor Summary
ConstructorsConstructorDescriptionPolygonSimple(double[] xPoints, double[] yPoints) PolygonSimple(double[] xPoints, double[] yPoints, int length) PolygonSimple(int numberPoints) -
Method Summary
Modifier and TypeMethodDescriptionvoidadd(double x, double y) Adds a point to the polygon.voidclone()booleancontains(double inX, double inY) tests whether the given point is contained in the polygon (linear time).booleancontains(double x, double y, double w, double h) tests whether each corner point of the given rectangle is contained in the polygon.booleancontains(com.macrofocus.geom.Point2D point) booleanconvexClip(PolygonSimple poly) Uses the linear time algorithm of O'Rourke to compute the intersection of two convex polygons.static doublecrossProduct(Point2D p1, Point2D p2) static doubledistancePointToSegment(double x1, double y1, double x2, double y2, double x3, double y3) * Shortest Distance from a Point p3 to a line segment p1-p2 http://local.wasp.uwa.edu.au/~pbourke/geometry/pointline/doublegetArea()Returns the area of the polygon.com.macrofocus.geom.RectangleReturns the bounding rectangle of this polygon.com.macrofocus.geom.Rectangle2DComputes the centroid of a polygon.com.macrofocus.geom.PathIteratorgetFlattenPathIterator(double flatness) Returns a random point in the polygon.getIntersectionWithPolygon(Double inx, Double iny, Double outx, Double outy) Computes the intersection point iff (inx,iny) is within the polygon and (outx,outy) is outside of the polygon.doublegetMinDistanceToBorder(double x, double y) For the given point, the minimal distance to the segments of the polygon is computed.intReturn the number of points in this polygon.If the polygon is modified by e.g.com.macrofocus.geom.PathIteratorcom.macrofocus.geom.PathIteratorgetPathIterator(com.macrofocus.geom.AffineTransform at) Returns the path iterator for the shape(rather slow compared to using the point arrays directly).com.macrofocus.geom.PathIteratorgetPathIterator(com.macrofocus.geom.AffineTransform at, double flatness) getRelativePosition(Point2D vector) We get a vector which describes where the point should be relative to the center.double[]Array with x-values of the polygon points.double[]Array with y-values of the polygon points.booleanintersects(com.macrofocus.geom.Rectangle2D r) tests whether the given rectangle will intersect to the bounds of the polygon.voidPolygonSimple(PolygonSimple simple) Replaces the pointers of the coordinate arrays to show to the given coordinate arrays.voidscale(double scalingFactor) Scales all points by multiplying with the scalingFactorvoidshrinkForBorder(double percentage) Default percentage can be 0.96voidtranslate(double tx, double ty) Translates all points of the polygon by adding the values
-
Field Details
-
seed
Used for generation of a random point in a polygon. -
centroid
centroid of the polygon is stored for faster access, once it is computed -
area
protected double area -
bounds
protected com.macrofocus.geom.Rectangle2D.Double bounds -
oldPolygon
Stores the orginal polygon result, without shrinking -
x
protected double[] x -
y
protected double[] yx-coordinates -
length
public int lengthy-coordinates
-
-
Constructor Details
-
PolygonSimple
public PolygonSimple() -
PolygonSimple
public PolygonSimple(int numberPoints) - Parameters:
numberPoints- initial array size, default initial array size is 16.
-
PolygonSimple
public PolygonSimple(double[] xPoints, double[] yPoints, int length) - Parameters:
xPoints- x-coordinate of the polygon pointsyPoints- y-coordinate of the polygon pointslength- number of elements which should be considered from the given arrays
-
PolygonSimple
public PolygonSimple(double[] xPoints, double[] yPoints) - Parameters:
xPoints- x-coordinate of the polygon pointsyPoints- y-coordinate of the polygon points
-
-
Method Details
-
crossProduct
-
distancePointToSegment
public static double distancePointToSegment(double x1, double y1, double x2, double y2, double x3, double y3) * Shortest Distance from a Point p3 to a line segment p1-p2 http://local.wasp.uwa.edu.au/~pbourke/geometry/pointline/- Parameters:
x1- x value of first segment pointy1- y value of first segment pointx2- x value of second segment pointy2- y value of second segment pointx3- x value of point we are interested iny3- y value of point we are interested in- Returns:
-
PolygonSimple
Replaces the pointers of the coordinate arrays to show to the given coordinate arrays. -
contains
public boolean contains(double inX, double inY) tests whether the given point is contained in the polygon (linear time). -
contains
-
contains
public boolean contains(double x, double y, double w, double h) tests whether each corner point of the given rectangle is contained in the polygon. -
getBounds2D
public com.macrofocus.geom.Rectangle2D getBounds2D()- Specified by:
getBounds2Din interfacecom.macrofocus.geom.Shape
-
getPathIterator
public com.macrofocus.geom.PathIterator getPathIterator(com.macrofocus.geom.AffineTransform at) Returns the path iterator for the shape(rather slow compared to using the point arrays directly).- Specified by:
getPathIteratorin interfacecom.macrofocus.geom.Shape
-
contains
public boolean contains(com.macrofocus.geom.Point2D point) - Specified by:
containsin interfacecom.macrofocus.geom.Shape
-
getPathIterator
public com.macrofocus.geom.PathIterator getPathIterator()- Specified by:
getPathIteratorin interfacecom.macrofocus.geom.Shape
-
getFlattenPathIterator
public com.macrofocus.geom.PathIterator getFlattenPathIterator(double flatness) - Specified by:
getFlattenPathIteratorin interfacecom.macrofocus.geom.Shape
-
getPathIterator
public com.macrofocus.geom.PathIterator getPathIterator(com.macrofocus.geom.AffineTransform at, double flatness) -
intersects
public boolean intersects(com.macrofocus.geom.Rectangle2D r) tests whether the given rectangle will intersect to the bounds of the polygon.- Specified by:
intersectsin interfacecom.macrofocus.geom.Shape
-
getBounds
public com.macrofocus.geom.Rectangle getBounds()Returns the bounding rectangle of this polygon.- Specified by:
getBoundsin interfacecom.macrofocus.geom.Shape
-
getNumPoints
public int getNumPoints()Return the number of points in this polygon.- Returns:
- integer number of points
-
add
public void add(double x, double y) Adds a point to the polygon. Extends the corresponding array if necessary. -
scale
public void scale(double scalingFactor) Scales all points by multiplying with the scalingFactor- Parameters:
scalingFactor-
-
translate
public void translate(double tx, double ty) Translates all points of the polygon by adding the values- Parameters:
tx- translation on xty- translation on y
-
add
-
convexClip
Uses the linear time algorithm of O'Rourke to compute the intersection of two convex polygons.- Parameters:
poly-- Returns:
-
getArea
public double getArea()Returns the area of the polygon. -
getMinDistanceToBorder
public double getMinDistanceToBorder(double x, double y) For the given point, the minimal distance to the segments of the polygon is computed.- Parameters:
x-y-- Returns:
-
getCentroid
Computes the centroid of a polygon.- Returns:
- centroid point
-
clone
-
shrinkForBorder
public void shrinkForBorder(double percentage) Default percentage can be 0.96- Parameters:
percentage-
-
getRelativePosition
We get a vector which describes where the point should be relative to the center. We change the length of the vector so that the point fits in the polygon. (reimplementation needed here)- Returns:
- Point which is contained by this polygon and has same direction as the given vector point
-
getInnerPoint
Returns a random point in the polygon.- Returns:
-
getIntersectionWithPolygon
Computes the intersection point iff (inx,iny) is within the polygon and (outx,outy) is outside of the polygon. Returns null if the is no intersection or the line crosses the complete polygon.- Parameters:
inx- x-coordinate of the presumably inner pointiny- y-coordiante of the presumably inner pointoutx- x-coordinate of the presumably outer pointouty- y-coordinate of the presumably outer point- Returns:
- Intersection Point
-
getXPoints
public double[] getXPoints()Array with x-values of the polygon points.- Returns:
-
getYPoints
public double[] getYPoints()Array with y-values of the polygon points.- Returns:
-
getOriginalPolygon
If the polygon is modified by e.g. shrinking, this method returns the original polygon. If the polyogn was not modified, it can return null.- Returns:
-