Article

Free access

Shadows and slices of polytopes

Authors:

Nina Amenta,

Günter M. ZieglerAuthors Info & Claims

SCG '96: Proceedings of the twelfth annual symposium on Computational geometry

Pages 10 - 19

https://doi.org/10.1145/237218.237228

Published: 01 May 1996 Publication History

PDF eReader

References

[1]

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.

Google Scholar

[2]

David Avi., and Komei Fukuda. A pivoting algorithn~ for convex hulls and vertex enumeration of arrangements and polyhedra. Dl.~cr~te a.d Computatto.al G(on~~tr'q 8 (1992) 295-314.

Google Scholar

[3]

Karl Heinz Borgwardt The Simplex 5lethod. A Probabilistic Analysis. Algorttbm.$ a.d Combtnalomcs 1. Springer 1987.

Google Scholar

[4]

Timothy Chan. Output-sensitive results on convex hulls, extreme points and related problems. Proceedt.gs of the lltb A,nual,5"ympostum on Compulattonal Geometry (1995). 10-19.

Digital Library

Google Scholar

[5]

Bernard ('hazelle. Herbert Edelsbrunner and Leonidas J. Guibas. The complexity of' cutting complexes, Discrete a,d ('omputattonal Geometry 4 (1989), 139-182,

Google Scholar

[6]

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.

Google Scholar

[7]

Saul i. Gass and Thomas Saaty. The computational algorithm for the parametric objective function. Xaval Research Logistics Quarterly 2 (1955), 39-45.

Crossref

Google Scholar

[8]

Donald Goldfarb. Worst case complexity of the shadow vertex simplex algorithm, prepr'lnt. Columbia University (198:3). 11 pages.

Google Scholar

[9]

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.

Google Scholar

[10]

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.

Google Scholar

[11]

Jif:~ Matou~ek. Linear oprimazation queries, Journal of Algorithms 14 (1993), 432-448. Also, with Otfried Schwarzkopf in Proceedings of the Bib Annual Symposium on Compulattonal Geometry (1992) 16-25.

Digital Library

Google Scholar

[12]

Katta G. Murty. Computational complexity of parametric linear programming, Mathcmatzcal Programmtng 19 (1980), 213-219.

Digital Library

Google Scholar

[13]

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).

Crossref

Google Scholar

[14]

Jean Ponce, Steve Sullivan, Attawith Sudsang. Jean-Daniel Boissonnat and Jean-Pierre Merlet. On computing four-finger equilibrium and forceclosure grasps of polyhedral objects, to appear in the Internatzonal Journal of Robotics Research, (1996).

Digital Library

Google Scholar

[15]

Raimund Seidel. Constructing higher dimensional convex hulls at logarithmic cost per face, Proceedzngs of the 18th Annual Symposium on the Theory of Computzng, (1986), 404-413.

Digital Library

Google Scholar

[16]

Bernd Sturrnfels. Cyclic polytopes and d-order curves, Geometriae Dedicata 24 (1987) 103-107.

Google Scholar

[17]

Giinter M. Ziegler. Lectures on Polytopes. Graduate Texts in Mathematics 152, Springer-Verlag, New York 1995.

Google Scholar

Cited By

View all

Chiang LHuang YLi WRodina LWeng H(2022)Into the EFThedron and UV constraints from IR consistencyJournal of High Energy Physics10.1007/JHEP03(2022)0632022:3Online publication date: 9-Mar-2022
https://doi.org/10.1007/JHEP03(2022)063
Howe JKing A(2012)Polyhedral analysis using parametric objectivesProceedings of the 19th international conference on Static Analysis10.1007/978-3-642-33125-1_6(41-57)Online publication date: 11-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-33125-1_6
Rörig TWitte NZiegler G(2009)Zonotopes with Large 2D-CutsDiscrete & Computational Geometry10.5555/3116261.311640142:4(527-541)Online publication date: 1-Dec-2009
https://dl.acm.org/doi/10.5555/3116261.3116401
Show More Cited By

Index Terms

Shadows and slices of polytopes
1. Mathematics of computing
  1. Mathematical analysis
    1. Mathematical optimization
      1. Continuous optimization
        Linear programming
    2. Numerical analysis
      1. Computations on matrices
2. Theory of computation
  1. Design and analysis of algorithms
    1. Mathematical optimization
      1. Continuous optimization
        Linear programming
  2. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Shadows and Soft Shadows with Participating Media Using Splatting

This paper describes an efficient algorithm to model the light attenuation due to a participating media with low albedo. Here, we consider the light attenuation along a ray, as well as the light attenuation emanating from a surface. The light ...
Families of Tight Inequalities for Polytopes

We use the Billera-Liu algebra to show how the flag f-vectors of several special classes of polytopes fit into the closed convex hull of the flag f-vectors of all polytopes. In particular, we describe inequalities that define the faces of the closed ...
Smooth hyperbolicity cones are spectrahedral shadows

Hyperbolicity cones are convex algebraic cones arising from hyperbolic polynomials. A well-understood subclass of hyperbolicity cones is that of spectrahedral cones and it is conjectured that every hyperbolicity cone is spectrahedral. In this paper we ...

Comments

Information & Contributors

Information

Published In

SCG '96: Proceedings of the twelfth annual symposium on Computational geometry

May 1996

406 pages

ISBN:0897918045

DOI:10.1145/237218

Chairman:
Sue Whitesides
McGill Univ.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SoCG96

Sponsor:

SoCG96: 12th ACM Symposium on Computational Geometry

May 24 - 26, 1996

Pennsylvania, Philadelphia, USA

Acceptance Rates

SCG '96 Paper Acceptance Rate 48 of 93 submissions, 52%;

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
574
Total Downloads

Downloads (Last 12 months)108
Downloads (Last 6 weeks)14

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chiang LHuang YLi WRodina LWeng H(2022)Into the EFThedron and UV constraints from IR consistencyJournal of High Energy Physics10.1007/JHEP03(2022)0632022:3Online publication date: 9-Mar-2022
https://doi.org/10.1007/JHEP03(2022)063
Howe JKing A(2012)Polyhedral analysis using parametric objectivesProceedings of the 19th international conference on Static Analysis10.1007/978-3-642-33125-1_6(41-57)Online publication date: 11-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-33125-1_6
Rörig TWitte NZiegler G(2009)Zonotopes with Large 2D-CutsDiscrete & Computational Geometry10.5555/3116261.311640142:4(527-541)Online publication date: 1-Dec-2009
https://dl.acm.org/doi/10.5555/3116261.3116401
Jones CKerrigan EMaciejowski J(2008)On Polyhedral Projection and Parametric ProgrammingJournal of Optimization Theory and Applications10.1007/s10957-008-9384-4138:2(207-220)Online publication date: 1-Aug-2008
https://dl.acm.org/doi/10.1007/s10957-008-9384-4
Rörig TWitte NZiegler G(2008)Zonotopes with Large 2D-CutsDiscrete & Computational Geometry10.1007/s00454-008-9088-442:4(527-541)Online publication date: 21-Jun-2008
https://doi.org/10.1007/s00454-008-9088-4
Matoušek JSzabó T(2006)RANDOM EDGE can be exponential on abstract cubesAdvances in Mathematics10.1016/j.aim.2005.05.021204:1(262-277)Online publication date: Aug-2006
https://doi.org/10.1016/j.aim.2005.05.021
Schurr ISzabó T(2005)Jumping doesn't help in abstract cubesProceedings of the 11th international conference on Integer Programming and Combinatorial Optimization10.1007/11496915_17(225-235)Online publication date: 8-Jun-2005
https://dl.acm.org/doi/10.1007/11496915_17
Matousek JSzabo T(2004)Random Edge Can Be Exponential on Abstract CubesProceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science10.1109/FOCS.2004.56(92-100)Online publication date: 17-Oct-2004
https://dl.acm.org/doi/10.1109/FOCS.2004.56
Amenta NWhitesides S(1996)Four-polytopes and a funeral (for my conjecture)Proceedings of the twelfth annual symposium on Computational geometry10.1145/237218.237422(501-502)Online publication date: 1-May-1996
https://dl.acm.org/doi/10.1145/237218.237422

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Shadows and Soft Shadows with Participating Media Using Splatting

Families of Tight Inequalities for Polytopes

Smooth hyperbolicity cones are spectrahedral shadows

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Shadows and Soft Shadows with Participating Media Using Splatting

Families of Tight Inequalities for Polytopes

Smooth hyperbolicity cones are spectrahedral shadows

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations