Convex hull of planarh-polyhedra
From MaRDI portal
Publication:4831398
Recommendations
Cites work
- scientific article; zbMATH DE number 3841211 (Why is no real title available?)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- A reevaluation of an efficient algorithm for determining the convex hull of a finite planar set
- Algorithm for discovering the set of all the solutions of a linear programming problem
- An efficient algorithm for determining the convex hull of a finite planar set
- Some characterizations of convex polyhedra
Cited in
(15)- On the complexity of convex hulls of subsets of the two-dimensional plane
- The two variable per inequality abstract domain
- A new algorithm for computing the convex hull of a planar point set
- Relative convex hull determination from convex hulls in the plane
- On the convex hull of the union of certain polyhedra
- Comparison of convex hulls and box hulls.
- A new linear convex hull algorithm for simple polygons (Corresp.)
- Convex hulls of spatial polygons with a fixed convex projection
- Calculation of partially convex hulls and approximations for finite planar sets
- Szlenk indices of convex hulls
- Computing \(D\)-convex hulls in the plane
- \(\alpha\)-concave hull, a generalization of convex hull
- Forced convex \(n\)-gons in the plane
- Convex hull properties and algorithms
- Extended convex hull
This page was built for publication: Convex hull of planarh-polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4831398)