Convex hull of planarh-polyhedra
From MaRDI portal
Publication:4831398
DOI10.1080/00207160310001650034zbMATH Open1074.65024OpenAlexW2008498655MaRDI QIDQ4831398FDOQ4831398
Authors: Axel Simon, Andy King 
Publication date: 29 December 2004
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160310001650034
Recommendations
Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- An efficient algorithm for determining the convex hull of a finite planar set
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Algorithm for discovering the set of all the solutions of a linear programming problem
- Some characterizations of convex polyhedra
- Title not available (Why is that?)
- A reevaluation of an efficient algorithm for determining the convex hull of a finite planar set
Cited In (15)
- A new algorithm for computing the convex hull of a planar point set
- \(\alpha\)-concave hull, a generalization of convex hull
- Computing \(D\)-convex hulls in the plane
- On the convex hull of the union of certain polyhedra
- Comparison of convex hulls and box hulls.
- On the complexity of convex hulls of subsets of the two-dimensional plane
- Szlenk indices of convex hulls
- A new linear convex hull algorithm for simple polygons (Corresp.)
- Forced convex \(n\)-gons in the plane
- Convex hull properties and algorithms
- The two variable per inequality abstract domain
- Convex hulls of spatial polygons with a fixed convex projection
- Calculation of partially convex hulls and approximations for finite planar sets
- Relative convex hull determination from convex hulls in the plane
- 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)
