The following pages link to (Q4763392):
Displaying 19 items.
- Algorithms for optimal outlier removal (Q1026234) (← links)
- A new algorithm for the minimal-area convex enclosure problem (Q1127205) (← links)
- Finding minimum area \(k\)-gons (Q1186081) (← 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)
- Computing the smallest \(k\)-enclosing circle and related problems (Q1328752) (← links)
- Counting convex polygons in planar point sets (Q1350236) (← links)
- Covering points with convex sets of minimum size (Q1705773) (← links)
- The Santalo point of a planar convex set (Q1802415) (← links)
- Smallest nonparametric tolerance regions. (Q1848908) (← links)
- Largest and smallest area triangles on imprecise points (Q1984599) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- On rainbow quadrilaterals in colored point sets (Q2676756) (← links)
- Empty squares in arbitrary orientation among points (Q2700381) (← links)
- Minimum area polygons with two reflex angles enclosing<i>k</i>Points (Q2752250) (← links)
- Covering Points with Convex Sets of Minimum Size (Q2803821) (← links)
- An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest (Q5056924) (← links)
- Computing the smallest k-enclosing circle and related problems (Q5060125) (← links)
