| Package | Description |
|---|---|
| org.jdelaunay.delaunay.geometries | |
| org.jdelaunay.delaunay.tools |
| Modifier and Type | Class and Description |
|---|---|
class |
ConstraintPolygon
Delaunay Package.
|
class |
DEdge
An edge in the tringulation.
|
class |
DPoint
The smallest geometric element of a mesh.
|
class |
DTriangle
This is the class representing a Triangle in the DelaunayTriangulation.
|
| Modifier and Type | Method and Description |
|---|---|
Element |
DTriangle.getCircumCenterContainer()
Return the triangle of the mesh that contains the center of this DTriangle.
|
Element |
DTriangle.getCircumCenterContainerSafe()
Return the triangle of the mesh that contains the center of this DTriangle.
|
Element |
DEdge.getIntersection(DEdge ed)
intersects two edges returns null if there is no intersection
|
Element |
DEdge.getIntersection(DEdge ed,
Map<Integer,Integer> weights)
Get the intersection, using the weights given in argument to compute the z :
we will use the z from the edge with the highest weight.
|
Element |
DEdge.getIntersection(DPoint p1,
DPoint p2)
intersects two edges returns null if there is no intersection
|
Element |
DEdge.getIntersection(DPoint point1,
DPoint point2,
boolean useCoordZOfp1p2)
intersects two edges returns null if there is no intersection
if the two edgse are colinear, returns the minimum intersection point,
if such a point exists.
|
Element |
DTriangle.searchPointContainer(DPoint pt)
This method recursively search for pt in the mesh.
|
| Constructor and Description |
|---|
Element(Element element)
Constructor
|
| Modifier and Type | Method and Description |
|---|---|
static <T extends Element> |
Tools.addToSortedList(T elt,
List<T> sortedList,
Comparator<T> comp)
Add an element to the list.
|
static <T extends Element> |
Tools.sortedListContains(List<T> sortedList,
T elt,
Comparator<T> comp)
Search the element elt in the sorted list sortedList.
|
Copyright © 2013 IRSTV CNRS-FR-2488. All Rights Reserved.