AN ORACLE-BASED, OUTPUT-SENSITIVE ALGORITHM FOR PROJECTIONS OF RESULTANT POLYTOPES

DOI10.1142/S0218195913600108zbMath1297.68238arXiv1108.5985OpenAlexW2964260221WikidataQ57908679 ScholiaQ57908679MaRDI QIDQ2875648

Ioannis Z. Emiris, Christos Konaxis, Vissarion Fisikopoulos, Luis Mariano Peñaranda

Publication date: 11 August 2014

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.5985

zbMATH Keywords

convex hullresultantgeneral dimensionsecondary polytoperegular triangulationCGAL implementationexperimental complexity

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Faster geometric algorithms via dynamic determinant computation ⋮ Numerical software to compute Newton polytopes and tropical membership ⋮ Efficient edge-skeleton computation for polytopes defined by oracles ⋮ Implicit representations of high-codimension varieties

Uses Software

• CGAL
• TropLi
• triangulation

Cites Work

• Four results on randomized incremental constructions
• A characterization of A-discriminantal hypersurfaces in terms of logarithmic Gauss map
• Enumerating regular mixed-cell configurations
• On the Newton polytope of the resultant
• How good are convex hull algorithms?
• On the complexity of computing determinants
• Computing tropical linear spaces
• Decomposing the secondary Cayley polytope
• The volume of the Newton polytope of a discriminant
• ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS