The following pages link to On a triangle counting problem (Q909463):
Displaying 14 items.
- Counting \(k\)-subsets and convex \(k\)-gons in the plane (Q1178214) (← links)
- Counting convex \(k\)-gons in planar point sets (Q1190511) (← links)
- Geometric medians (Q1201233) (← links)
- Counting convex polygons in planar point sets (Q1350236) (← links)
- Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. (Q1395576) (← links)
- On Liu's simplicial depth and Randles' interdirections (Q1659197) (← links)
- Computing colourful simplicial depth and Median in \(\mathbb{R}_2\) (Q2135626) (← links)
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices (Q2207612) (← links)
- Enumerating trichromatic triangles containing the origin in linear time (Q2376788) (← links)
- Algorithms for bivariate zonoid depth (Q2456661) (← links)
- Algorithms for Colourful Simplicial Depth and Medians in the Plane (Q2958332) (← links)
- Crossing-Free Perfect Matchings in Wheel Point Sets (Q4604397) (← links)
- FITTING A STEP FUNCTION TO A POINT SET WITH OUTLIERS BASED ON SIMPLICIAL THICKNESS DATA STRUCTURES (Q5299999) (← links)
- FINDING SIMPLICES CONTAINING THE ORIGIN IN TWO AND THREE DIMENSIONS (Q5388706) (← links)
