Shadows and slices of polytopes

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Shadows and slices of polytopes

Full text

Pdf (784 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the twelfth annual symposium on Computational geometry table of contents

Philadelphia, Pennsylvania, United States

Pages: 10 - 19

Year of Publication: 1996

ISBN:0-89791-804-5

Authors

Nina Amenta	Xerox PARC, 3333 Coyote Hill Road, Palo Alto, CA
Günter M. Ziegler	Dept. Mathematics 6-1, Technische Universität, Berlin, 10623 Berlin, Germany

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 9, Downloads (12 Months): 41, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/237218.237228 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	AAAS	Pankaj Agarwal. Nina Arnenta. Boris Aronov and 5Iicha Sharir. Largest placements and motion planning of a convex polygon, subnlitted to D~.screle a,d ('on~puial~onal Geometry.
	AvFu	David Avis , Komei Fukuda, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, Discrete & Computational Geometry, v.8 n.3, p.295-313, 1992 [doi>10.1007/BF02293050]
	Borg	Karl Heinz Borgwardt The Simplex 5lethod. A Probabilistic Analysis. Algorttbm.$ a.d Combtnalomcs 1. Springer 1987.
	Chan	Timothy M. Chan, Output-sensitive results on convex hulls, extreme points, and related problems, Proceedings of the eleventh annual symposium on Computational geometry, p.10-19, June 05-07, 1995, Vancouver, British Columbia, Canada [doi>10.1145/220279.220281]
	CEG	B. Chazelle , H. Edelsbrunner , L. Guibas, The complexity of cutting complexes, Discrete & Computational Geometry, v.4 n.2, p.139-181, Jan. 1989 [doi>10.1007/BF02187720]
	GZ	Bernd G~irtner and Giinter M. Ziegler. Randomized simplex algorithms on Klee-Minty cubes. Proceedl,gs of the .351h An.ual ,5'ympostum on Foundatlo.6 of ('omputer Science (1994) 502- 510.
	GS	Saul i. Gass and Thomas Saaty. The computational algorithm for the parametric objective function. Xaval Research Logistics Quarterly 2 (1955), 39-45.
	Gol1	Donald Goldfarb. Worst case complexity of the shadow vertex simplex algorithm, prepr'lnt. Columbia University (198:3). 11 pages.
	Gol2	Donald Goldfarb. On the complexity of the simplex algorithm, in' Advances tn opttmtzat~on a.d numertcal analy- .~t.s. Proc. 6th Workshop on Optimizatioll and Numerical Analysis. Oaxaca. 5lexlco. January 19~)2' Kluwer. Dordrecht 1994.25-38.
	KlMi	Victor Klee and George J. Minty. How good is the simplex algorithm?. I,- equalities iII, (0. Shisha. ed.). Academic Press, New York, (1972). 159- 175.
	Mat	Jiří Matoušek, Linear optimization queries, Journal of Algorithms, v.14 n.3, p.432-448, May 1993 [doi>10.1006/jagm.1993.1023]
	Mu	Katta G. Murty. Computational complexity of parametric linear programming, Mathcmatzcal Programmtng 19 (1980), 213-219.
	PoFa	Jean Ponce and Bernard Faverjon. On computing three-finger force-closure grasps of polygonal objects, to appear in IEEE Transactions on Robotics and Automation, 11:6, (1995).
	PSSBM	Jean Ponce , Steve Sullivan , Attawith Sudsang , Jean-Daniel Boissonnat , Jean-Pierre Merlet, On computing four-finger equilibrium and force-closure grasps of polyhedral objects, International Journal of Robotics Research, v.16 n.1, p.11-35, Feb. 1997 [doi>10.1177/027836499701600102]
	Sei	R Seidel, Constructing higher-dimensional convex hulls at logarithmic cost per face, Proceedings of the eighteenth annual ACM symposium on Theory of computing, p.404-413, May 28-30, 1986, Berkeley, California, United States [doi>10.1145/12130.12172]
	Stur	Bernd Sturrnfels. Cyclic polytopes and d-order curves, Geometriae Dedicata 24 (1987) 103-107.
	Z	Giinter M. Ziegler. Lectures on Polytopes. Graduate Texts in Mathematics 152, Springer-Verlag, New York 1995.