The following pages link to Finding minimum area \(k\)-gons (Q1186081):
Displaying 30 items.
- The approximation algorithms for a class of multiple-choice problem (Q344788) (← links)
- Computing optimal islands (Q433119) (← links)
- Sequential and parallel algorithms for finding a maximum convex polygon (Q676573) (← links)
- Geometric Knapsack problems (Q689105) (← links)
- Optimum turn-restricted paths, nested compatibility, and optimum convex polygons (Q724738) (← links)
- Algorithms for optimal outlier removal (Q1026234) (← links)
- Counting \(k\)-subsets and convex \(k\)-gons in the plane (Q1178214) (← links)
- Stacks, queues, and deques with order-statistic operations (Q1203596) (← links)
- Finding minimum area simple pentagons (Q1267196) (← links)
- Iterated nearest neighbors and finding minimal polytopes (Q1327455) (← links)
- Counting convex polygons in planar point sets (Q1350236) (← links)
- Covering points with convex sets of minimum size (Q1705773) (← links)
- An algorithm to find maximum area polygons circumscribed about a convex polygon (Q1727731) (← links)
- LMT-skeleton heuristics for several new classes of optimal triangulations (Q1841243) (← links)
- Smallest nonparametric tolerance regions. (Q1848908) (← links)
- Largest and smallest area triangles on imprecise points (Q1984599) (← links)
- Extremal convex polygons inscribed in a given convex polygon (Q2064020) (← links)
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices (Q2207612) (← links)
- On rainbow quadrilaterals in colored point sets (Q2676756) (← links)
- Bottleneck convex subsets: finding \(k\) large convex sets in a point set (Q2695286) (← links)
- Empty squares in arbitrary orientation among points (Q2700381) (← links)
- Covering Points with Convex Sets of Minimum Size (Q2803821) (← links)
- THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS (Q2875647) (← links)
- Finding a Maximum-Weight Convex Set in a Chordal Graph (Q3121516) (← links)
- An Approximation Algorithm for the Smallest Color-Spanning Circle Problem (Q3196382) (← links)
- Convex Polygons in Geometric Triangulations (Q3449827) (← links)
- Convex partial transversals of planar regions (Q5091044) (← links)
- An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets (Q5266598) (← links)
- Convex Polygons in Geometric Triangulations (Q5366966) (← links)
- Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set (Q6173215) (← links)
