Degree-driven design for correct geometric algorithms

DOI10.1007/978-3-642-21204-8_4MaRDI QIDQ3004650zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jack Snoeyink

Publication date 3 June 2011

Published in Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21204-8_4

zbMATH Keywords

computational geometrygeometric predicates

Mathematics Subject Classification ID

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

Recommendations

• Two design principles of geometric algorithms in finite-precision arithmetic
• Computing planar Voronoi diagrams in double precision, a further example of degree-driven algorithm design
• scientific article; zbMATH DE number 1008329
• scientific article; zbMATH DE number 53811
• Reliable and Efficient Geometric Computing

Cited in

(2)

• Computing planar Voronoi diagrams in double precision, a further example of degree-driven algorithm design
• Two design principles of geometric algorithms in finite-precision arithmetic

This page was built for publication: Degree-driven design for correct geometric algorithms

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