Robust geometric computation: Difference between revisions

Content deleted Content added

Revision as of 14:26, 7 February 2022 edit Kku (talk \| contribs) Extended confirmed users 121,760 edits m link floating-point arithmetic using Find link ← Previous edit		Latest revision as of 23:16, 12 May 2024 edit undo Jlwoodwa (talk \| contribs) Autopatrolled, Administrators 106,392 edits tag as inline
(One intermediate revision by one other user not shown)
Line 1: {{inline \|date=May 2024}} In mathematics, specifically in [[computational geometry]], '''geometric nonrobustness''' is a problem wherein branching decisions in [[computational geometry]] algorithms are based on approximate numerical computations, leading to various forms of unreliability including ill-formed output and software failure through crashing or infinite loops. Line 17 ⟶ 18: \| title = Numerical robustness in geometric computation: an expository summary \| volume = 8 \| year = 2014}}\| s2cid = 54807426 }} *{{citation \| last1 = Sharma \| first1 = Vikram