A new look at euclid's second proposition

Research output: Contribution to journalArticle

Abstract

We mention in closing that even the 20th-century Algorithm CO pales by comparison with Algorithm Euclid from the point of view of robustness with respect to singularities. Consider, for example, the case where point C happens to lie at a location equidistant from A and B. Algorithm Euclid executes in this case as easily as in any other because everything is well-defined. Without special flag-waving code, however, Algorithm CO could crash attempting to draw a circle with radius zero and then intersecting two circles, one of which has radius zero.

Original languageEnglish (US)
Pages (from-to)12-24
Number of pages13
JournalThe Mathematical Intelligencer
Volume15
Issue number3
DOIs
StatePublished - Sep 1 1993

Fingerprint

Euclidean algorithm
Euclid
Proposition
Circle
Radius
Equidistant
Zero
Crash
Well-defined
Singularity
Robustness

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

A new look at euclid's second proposition. / Toussaint, Godfried.

In: The Mathematical Intelligencer, Vol. 15, No. 3, 01.09.1993, p. 12-24.

Research output: Contribution to journalArticle

@article{96acafa03d994afc81688eb3b41f095b,
title = "A new look at euclid's second proposition",
abstract = "We mention in closing that even the 20th-century Algorithm CO pales by comparison with Algorithm Euclid from the point of view of robustness with respect to singularities. Consider, for example, the case where point C happens to lie at a location equidistant from A and B. Algorithm Euclid executes in this case as easily as in any other because everything is well-defined. Without special flag-waving code, however, Algorithm CO could crash attempting to draw a circle with radius zero and then intersecting two circles, one of which has radius zero.",
author = "Godfried Toussaint",
year = "1993",
month = "9",
day = "1",
doi = "10.1007/BF03024252",
language = "English (US)",
volume = "15",
pages = "12--24",
journal = "Mathematical Intelligencer",
issn = "0343-6993",
publisher = "Springer New York",
number = "3",

}

TY - JOUR

T1 - A new look at euclid's second proposition

AU - Toussaint, Godfried

PY - 1993/9/1

Y1 - 1993/9/1

N2 - We mention in closing that even the 20th-century Algorithm CO pales by comparison with Algorithm Euclid from the point of view of robustness with respect to singularities. Consider, for example, the case where point C happens to lie at a location equidistant from A and B. Algorithm Euclid executes in this case as easily as in any other because everything is well-defined. Without special flag-waving code, however, Algorithm CO could crash attempting to draw a circle with radius zero and then intersecting two circles, one of which has radius zero.

AB - We mention in closing that even the 20th-century Algorithm CO pales by comparison with Algorithm Euclid from the point of view of robustness with respect to singularities. Consider, for example, the case where point C happens to lie at a location equidistant from A and B. Algorithm Euclid executes in this case as easily as in any other because everything is well-defined. Without special flag-waving code, however, Algorithm CO could crash attempting to draw a circle with radius zero and then intersecting two circles, one of which has radius zero.

UR - http://www.scopus.com/inward/record.url?scp=0040652841&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0040652841&partnerID=8YFLogxK

U2 - 10.1007/BF03024252

DO - 10.1007/BF03024252

M3 - Article

AN - SCOPUS:0040652841

VL - 15

SP - 12

EP - 24

JO - Mathematical Intelligencer

JF - Mathematical Intelligencer

SN - 0343-6993

IS - 3

ER -