A note on the complexity of real algebraic hypersurfaces

DOI10.1007/s00373-011-1020-7zbMath1238.14044OpenAlexW1965209643MaRDI QIDQ659701

Michael Sagraloff, Michael Kerber

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1020-7

zbMATH Keywords

triangulationalgebraic surfacesalgebraic curvesisotopy

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Topology of real algebraic varieties (14P25)

Related Items

SqFreeEVAL: An (almost) optimal real-root isolation algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• All 2-manifolds have finitely many minimal triangulations
• Effective computational geometry for curves and surfaces
• Irreducible triangulations of the torus
• On the asymptotic and practical complexity of solving bivariate systems over the reals
• Isotopic triangulation of a real algebraic surface
• An efficient algorithm for the stratification and triangulation of an algebraic surface
• Note on irreducible triangulations of surfaces
• On the topology of planar algebraic curves
• Algorithms in real algebraic geometry

This page was built for publication: A note on the complexity of real algebraic hypersurfaces