An output-sensitive algorithm for computing projections of resultant polytopes

DOI10.1145/2261250.2261276zbMATH Open1293.68288OpenAlexW2096543568WikidataQ57908704 ScholiaQ57908704MaRDI QIDQ2874580FDOQ2874580

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

Publication date: 7 August 2014

Published in: Proceedings of the twenty-eighth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: http://preprints.acmac.uoc.gr/116/4/acmac-0116.pdf

Recommendations

• An oracle-based, output-sensitive algorithm for projections of resultant polytopes
• Elimination theory and Newton polytopes
• Computing tropical resultants
• Efficient incremental algorithms for the sparse resultant and the mixed volume
• scientific article; zbMATH DE number 1961537

zbMATH Keywords

convex hullresultantgeneral dimensionsecondary polytoperegular triangulationCGAL implementationexperimental complexity

Mathematics Subject Classification ID

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

Cited In (7)

• Computing the Newton polygon of the implicit equation
• Pruning Algorithms for Pretropisms of Newton Polytopes
• Implicitization of curves and (hyper)surfaces using predicted support
• Sparse discriminants and applications
• Output-Sensitive Construction of the Union of Triangles
• Computing tropical resultants
• An oracle-based, output-sensitive algorithm for projections of resultant polytopes

Uses Software

• cdd
• CGAL
• TOPCOM
• Eigen
• Boost
• Hull

This page was built for publication: An output-sensitive algorithm for computing projections of resultant polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874580)