Reliable geometric computing

DOI10.1007/978-3-540-69995-8_17MaRDI QIDQ5391742zbMATH OpenOpenAlexFDO

Authors K. Mehlhorn

Publication date 7 April 2011

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69995-8_17

Mathematics Subject Classification ID

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

Recommendations

• Reliable and efficient geometric computing
• Reliable and Efficient Geometric Computing
• Reliable and Efficient Geometric Computing
• scientific article; zbMATH DE number 1182928
• scientific article; zbMATH DE number 53811

Cited in

(9)

• Introduction to the special issue: What can one learn from box-plane intersections?
• Reliable and Efficient Geometric Computing
• Reliable and Efficient Computational Geometry Via Controlled Perturbation
• scientific article; zbMATH DE number 4080990 (Why is no real title available?)
• scientific article; zbMATH DE number 1182928 (Why is no real title available?)
• Numerical Software with Result Verification
• Reliable and Efficient Geometric Computing
• Reliable and efficient geometric computing
• Computational geometry and discrete computations

This page was built for publication: Reliable geometric computing

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