An output-sensitive algorithm for computing projections of resultant polytopes

DOI10.1145/2261250.2261276zbMath1293.68288OpenAlexW2096543568WikidataQ57908704 ScholiaQ57908704MaRDI QIDQ2874580

Vissarion Fisikopoulos, Christos Konaxis, Ioannis Z. Emiris, Luis Mariano 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

convex hullresultantgeneral dimensionsecondary polytoperegular triangulationCGAL implementationexperimental complexity

Mathematics Subject Classification ID

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

Related Items (4)

Implicitization of curves and (hyper)surfaces using predicted support ⋮ Computing the Newton polygon of the implicit equation ⋮ Computing tropical resultants ⋮ Pruning Algorithms for Pretropisms of Newton 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