An output-sensitive algorithm for computing projections of resultant polytopes

DOI10.1145/2261250.2261276MaRDI QIDQ2874580zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

CGAL implementationconvex hullexperimental complexitygeneral dimensionregular triangulationresultantsecondary polytope

Mathematics Subject Classification ID

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

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

Cited in

(9)

• Numerical software to compute Newton polytopes
• Computing tropical resultants
• Pruning algorithms for pretropisms of Newton polytopes
• An oracle-based, output-sensitive algorithm for projections of resultant polytopes
• Combinatorics of 4-dimensional resultant polytopes
• Implicitization of curves and (hyper)surfaces using predicted support
• Output-Sensitive Construction of the Union of Triangles
• Computing the Newton polygon of the implicit equation
• Sparse discriminants and applications

Describes a project that uses

Uses Software

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

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)