Extended convex hull

Computational Geometry: Theory and Applications

Volumn 20, Issue 1-2, 2001, Pages 13-23

  Fukuda, Komei ^a   Liebling, Thomas M ^b   Lütolf, Christine ^b  

^a ETH ZURICH   (Switzerland)

^b EPFL   (Switzerland)

Author keywords

Convex hull; Linear programming; Polytopes

Indexed keywords

EID: 0035479464     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(01)00032-3     Document Type: Article

References (15)

1. Amenta N., Ziegler G.M. Deformed products and maximal shadows of polytopes. Adv. Discrete Comput. Geom. 223:1999;57-90.
2. Avis D., Fukuda K. A basis enumeration algorithm for linear systems with geometric applications. Appl. Math. Lett. 5:1991;39-42.
3. Avis D., Fukuda K. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete Comput. Geom. 8:1992;295-313.
4. Avis D., Fukuda K. Reverse search for enumeration. Discrete Appl. Math. 65:1996;21-46.
5. Balas E. On the convex hull of the union of certain polyhedra. Oper. Res. Lett. 7:(6):1988;279-283.
6. Bemporad A., Fukuda K., Torrisi F.D. Convexity recognition of the union of polyhedra. Computational Geometry. 18:2001;141-154.
7. Bremner D., Fukuda K., Marzetta A. Primal-dual methods for vertex and facet enumeration. Discrete Comput. Geom. 20:1998;333-357.
8. Bruggesser H., Mani P. Shellable decompositions of cells and spheres. Math. Scand. 29:1971;197-205.
9. Chand D.R., Kapur S.S. An algorithm for convex polytopes. J. of the ACM. 17:(1):1970;78-86.
10. Conforti M., Laurent M. On the facial structure of independence system polyhedra. Math. Oper. Res. 13:(4):1988;543-555.
11. K. Fukuda, An efficient pivot algorithm for finding all edges and all vertices of convex polytopes: 3-dimensional case, unpublished note, 1984.
12. Knuth D.E. The Art of Computer Programming, Vol. 3: Sorting and Searching. 1973;Addison-Wesley, Reading, MA.
13. Murty K.G. An algorithm for ranking all the assignments in order of increasing costs. Oper. Res. 16:1968;682-687.
14. Rote G. Degenerate convex hulls in high dimensions without extra storage. Proc. of 8th Annu. ACM Sympos. Comput. Geom., Berlin. 1992;26-32.
15. Seidel R. Constructing higher-dimensional convex hulls at logarithmic cost per face. Proc. of 18th Annu. ACM Sympos. Theory Comput., Berkeley, CA. 1986;404-413.