| Package | Description |
|---|---|
| org.opentrafficsim.core.geometry |
Copyright (c) 2013-2016 Delft University of Technology, PO Box 5, 2600 AA, Delft, the Netherlands.
|
| Modifier and Type | Method and Description |
|---|---|
static OTSShape |
OTSShape.createAndCleanOTSShape(List<OTSPoint3D> pointList)
Create an OTSLine3D, while cleaning repeating successive points.
|
static OTSShape |
OTSShape.createAndCleanOTSShape(OTSPoint3D[] points)
Create an OTSLine3D, while cleaning repeating successive points.
|
(package private) static OTSShape |
TestIntersectionPerformance.makeNGon(int numVertices,
double r,
double cX,
double cY)
Create and return an OTSShape.
|
OTSShape |
OTS2DSet.QuadTreeIterator.next() |
| Modifier and Type | Method and Description |
|---|---|
Set<OTSShape> |
OTS2DSet.intersectingShapes(OTSShape shape)
Return all OTSShapes in this OTS2DSet that intersect a given OTSShape.
|
Set<OTSShape> |
OTS2DSet.intersectingShapes(Rectangle2D rectangle)
Return the set of all shapes in this OTS2DSet that intersect the given rectangle.
|
Set<OTSShape> |
OTS2DSet.QuadTreeNode.intersectingShapes(Rectangle2D rectangle)
Return a Set containing all OTSShapes in this QuadTreeNode that intersect a rectangular area.
|
Iterator<OTSShape> |
OTS2DSet.iterator() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
OTS2DSet.add(OTSShape e) |
boolean |
OTS2DSet.QuadTreeNode.add(OTSShape shape)
Add an OTSShape to this QuadTreeNode.
|
Set<OTSShape> |
OTS2DSet.intersectingShapes(OTSShape shape)
Return all OTSShapes in this OTS2DSet that intersect a given OTSShape.
|
boolean |
OTSShape.intersects(OTSShape otsShape) |
boolean |
OTS2DSet.QuadTreeNode.intersects(OTSShape shape)
Test if the area of this QuadTree intersects an OTSShape.
|
boolean |
OTS2DSet.QuadTreeNode.remove(OTSShape shape)
Remove an OTSShape from this QuadTreeNode.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
OTS2DSet.addAll(Collection<? extends OTSShape> c) |
Copyright © 2014–2017 Delft University of Technology. All rights reserved.