Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon.
Sanjib SadhuSasanka RoySoumen NandiSubhas C. NandySuchismita RoyPublished in: Int. J. Found. Comput. Sci. (2020)
Keyphrases
- single pass
- matching algorithm
- computationally efficient
- high efficiency
- neural network
- convex hull
- experimental evaluation
- preprocessing
- optimal solution
- k means
- globally optimal
- computational cost
- high accuracy
- learning algorithm
- times faster
- np hard
- linear programming
- objective function
- segmentation algorithm
- optimization algorithm
- detection algorithm
- improved algorithm
- genetic algorithm
- expectation maximization
- worst case
- dynamic programming
- piecewise linear
- similarity measure
- path length
- constrained minimization