Robust geometric computation: Difference between revisions

Revision as of 22:01, 12 February 2014

Revision as of 22:04, 12 February 2014

Line 17:

Geometric algorithms are typically designed and analyzed using the Real-RAM

model of computation<ref><span style="color: rgb(34, 34, 34); font-family: Arial, sans-serif; line-height: 16.1200008392334px; background-color: rgb(255, 255, 255);">De Berg, M., Van Kreveld, M., Overmars, M., & Schwarzkopf, O. C. (2000). Computational geometry. </span>''Computational Geometry''<span style="color: rgb(34, 34, 34); font-family: Arial, sans-serif; line-height: 16.1200008392334px; background-color: rgb(255, 255, 255);">, 1-17.</span></ref>. In other words, these

model of computation. In other words, these

algorithms assume that the numerical data in geometric objects are exact

values in <math>\mathbb{R}</math> that can be stored and retrieved in constant time, and

Line 42:

== References ==

<!--- See http://en.wikipedia.org/wiki/Wikipedia:Footnotes on how to create references using <ref></ref> tags which will then appear here automatically -->

{{Reflist|refs = }}<references />

De Berg, M., Van Kreveld, M., Overmars, M., & Schwarzkopf, O. C. (2000). Computational geometry. Computational Geometry, 1-17.

== External links ==<!--- Categories --->

* [http://www.example.com/ example.com]

<!--- Categories --->

[[Category:Articles created via the Article Wizard]]