Enumerating trichromatic triangles containing the origin in linear time
From MaRDI portal
Publication:2376788
Recommendations
Cites work
- A generalization of Caratheodory's theorem
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Algorithm AS 307: Bivariate Location Depth
- Colourful Linear Programming and its Relatives
- Finding simplices containing the origin in two and three dimensions
- Finding the convex hull facet by facet
- Geometric medians
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 480237 (Why is no real title available?)
- scientific article; zbMATH DE number 1054763 (Why is no real title available?)
- scientific article; zbMATH DE number 1182912 (Why is no real title available?)
- On a triangle counting problem
- The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable
Cited in
(3)
This page was built for publication: Enumerating trichromatic triangles containing the origin in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376788)