37.1.1

alchemist/it.unibo.alchemist.model.obstacles/RectObstacle2D

RectObstacle2D

class RectObstacle2D<V : Vector2D<V>?> : Rectangle2D.Double, Obstacle2D<V>

This class implements a rectangular obstacle, whose sides are parallel to the cartesian axis.

Parameters

<V>

Constructors

constructor(x: Double, y: Double, w: Double, h: Double)

Builds a new RectObstacle2D, given a point, the width and the height.

Properties

open var height: Double

val id: Int

val maxX: Double

val maxY: Double

val minX: Double

val minY: Double

val OUT_BOTTOM: Int = 8

val OUT_LEFT: Int = 1

val OUT_RIGHT: Int = 4

val OUT_TOP: Int = 2

open var width: Double

open var x: Double

open var y: Double

Functions

open fun add(p: Double, p1: Double)

open fun clone(): Any

open fun contains(x: Double, y: Double): Boolean

createIntersection

open fun createIntersection(p: Rectangle2D): Rectangle2D

open fun createUnion(p: Rectangle2D): Rectangle2D

open fun equals(p: Any): Boolean

open fun getBounds(): Rectangle

open fun getBounds2D(): Rectangle2D

open fun getCenterX(): Double

open fun getCenterY(): Double

open fun getFrame(): Rectangle2D

open fun getHeight(): Double

abstract fun getId(): Int

The id for this obstacle.

open fun getMaxX(): Double

open fun getMaxY(): Double

open fun getMinX(): Double

open fun getMinY(): Double

getPathIterator

open fun getPathIterator(p: AffineTransform): PathIterator

open fun getWidth(): Double

open fun getX(): Double

open fun getY(): Double

open fun hashCode(): Int

open fun intersect(p: Rectangle2D, p1: Rectangle2D, p2: Rectangle2D)

open fun intersects(p: Double, p1: Double, p2: Double, p3: Double): Boolean

open fun intersectsLine(p: Double, p1: Double, p2: Double, p3: Double): Boolean

open fun isEmpty(): Boolean

nearestIntersection

open fun nearestIntersection(start: V, end: V): V

Given a vector (represented as a starting point and an end point), computes the intersection point between the vector and the obstacle nearest to the vector's starting point.

open fun next(start: V, end: V): V

Given a vector (starting point and end point) representing a requested move, this method computes a new end point, representing a cut version of the initial vector, modified in such a way that the end point is outside the obstacle.

open fun outcode(p: Double, p1: Double): Int

open fun setFrame(p: Double, p1: Double, p2: Double, p3: Double)

setFrameFromCenter

open fun setFrameFromCenter(p: Double, p1: Double, p2: Double, p3: Double)

setFrameFromDiagonal

open fun setFrameFromDiagonal(p: Double, p1: Double, p2: Double, p3: Double)

open fun setRect(p: Double, p1: Double, p2: Double, p3: Double)

open fun toString(): String

open fun union(p: Rectangle2D, p1: Rectangle2D, p2: Rectangle2D)

fun Shape.vertices(): List<Euclidean2DPosition>

Obtains the vertices of a polygonal shape. Any curved segment connecting two points will be considered as a straight line between them.