Finding simplices containing the origin in two and three dimensions
From MaRDI portal
Recommendations
Cites work
- Algorithm AS 307: Bivariate Location Depth
- Cutting hyperplanes for divide-and-conquer
- Finding the convex hull facet by facet
- Geometric medians
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- Lower bounds for computing statistical depth.
- On a triangle counting problem
- On enumerating minimal dicuts and strongly connected subgraphs
- Output-sensitive algorithms for computing nearest-neighbour decision boundaries
- Output-sensitive results on convex hulls, extreme points, and related problems
- Partitioning arrangements of lines. II: Applications
- The power of geometric duality
- The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable
Cited in
(4)
This page was built for publication: Finding simplices containing the origin in two and three dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5388706)