Algorithms – ESA 2004
From MaRDI portal
Publication:5464622
DOI10.1007/b100428zbMath1111.68788OpenAlexW2483610301MaRDI QIDQ5464622
Ioannis Z. Emiris, Elias P. Tsigaridas
Publication date: 18 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100428
Symbolic computation and algebraic computation (68W30) Computer science aspects of computer-aided design (68U07) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (8)
Real algebraic numbers and polynomial systems of small degree ⋮ Can we compute the similarity between surfaces? ⋮ Improving root separation bounds ⋮ Using signature sequences to classify intersection curves of two quadrics ⋮ On the complexity of real root isolation using continued fractions ⋮ Exact, efficient, and complete arrangement computation for cubic curves ⋮ The predicates of the Apollonius diagram: algorithmic analysis and implementation ⋮ An exact and efficient approach for computing a cell in an arrangement of quadrics
Uses Software
This page was built for publication: Algorithms – ESA 2004
