public class MinimumBoundingTriangle extends Object
The algorithm for finding minimum area enclosing triangles is based on an elegant geometric characterisation initially introduced in Klee & Laskowski. The algorithm iterates over each edge of the convex polygon setting side C of the enclosing triangle to be flush with this edge. A side S is said to be flush with edge E if S⊇E. The authors of O’Rourke et al. prove that for each fixed flush side C a local minimum enclosing triangle exists. Moreover, the authors have shown that:
O'Rourke provides a θ(n) algorithm for finding the minimal enclosing triangle of a 2D convex polygon with n vertices. However, the overall complexity for the concave computation is O(nlog(n)) because a convex hull must first be computed for the input geometry.
Constructor and Description |
---|
MinimumBoundingTriangle(org.locationtech.jts.geom.Geometry shape)
Creates a new instance of a Maximum Inscribed Triangle computation.
|
Modifier and Type | Method and Description |
---|---|
org.locationtech.jts.geom.Geometry |
getTriangle()
Gets a geometry which represents the Minimium Bounding Triangle.
|
Copyright © 2023. All rights reserved.