Algorithms for computing values and predicates associated with triangles.
For some algorithms extended-precision implementations are provided, which are more robust (i.e. they produce correct answers in more cases). Also, some more robust formulations of some algorithms are provided, which utilize normalization to the origin.
- Author
- JTS: Martin Davis
-
Benjamin Campbell
static geom::Location geos::triangulate::quadedge::TrianglePredicate::isInCircleNormalized |
( |
const CoordinateXY & |
a, |
|
|
const CoordinateXY & |
b, |
|
|
const CoordinateXY & |
c, |
|
|
const CoordinateXY & |
p |
|
) |
| |
|
static |
Tests if a point is inside the circle defined by the triangle with vertices a, b, c (oriented counter-clockwise). This test uses simple double-precision arithmetic, and thus is not 10% robust. However, by using normalization to the origin it provides improved robustness and increased performance.
Based on code by J.R.Shewchuk.
- Parameters
-
a | a vertex of the triangle |
b | a vertex of the triangle |
c | a vertex of the triangle |
p | the point to test |
- Returns
- true if this point is inside the circle defined by the points a, b, c
Referenced by geos::geom::CircularArc::containsPoint().