Pages that link to "Item:Q845931"
From MaRDI portal
The following pages link to A linear time algorithm for max-min length triangulation of a convex polygon (Q845931):
Displaying 7 items.
- Two linear-time algorithms for computing the minimum length polygon of a digital contour (Q765322) (← links)
- Implementation of linear minimum area enclosing triangle algorithm. Application note (Q2013616) (← links)
- Algorithms for optimal area triangulations of a convex polygon (Q2432732) (← links)
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour (Q3648777) (← links)
- (Q3704927) (← links)
- Linear algorithm to find the largest intriangles of a planar convex polygon (Q4246478) (← links)
- An algorithm for constructing locally optimal min-max triangulation (Q4346968) (← links)