The convex hull in a new model of computation

  title={The convex hull in a new model of computation},
  author={Abbas Edalat and Andr{\'e} Lieutier and Elham Kashefi},

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 17 references

A domain theoreti approa h to omputability on the real line

  • S. Fortune.
  • Theoreti al Computer S ien e
  • 1999

Domains for omputation in mathemati s , physi sand exa t real arithmeti

  • A.
  • Bulletin of Symboli Logi
  • 1997

How good are onvex hullalgorithms ?

  • D. Bremner, R. Seidel
  • Compt . Geom . Theory Appl .
  • 1997

Robust interval algorithm for urve interse tions

  • C. Y. Hu, N. M. Patrikalakis, X. Ye.
  • Computer - Aided Design
  • 1996

EÆ ient exa t arithmeti for omputational geometry

  • L. Guibas M. Goodri h, L. J. Guibas, D. Salesin, J. Stol.
  • Pro eeding of the 9 th ACM AnnualSymposium on…
  • 1993

Robust polygon modelling

  • D. R. Ferguson, N. F. Stewart, P. S. Fussell
  • Computer - AidedDesign
  • 1993

Robustness of numeri al methods in geometri omputation when problem data is un ertain

  • A. Edalat.
  • Computer - Aided Design Spe ial issueUn…
  • 1993

Finding the onvex hull fa et by fa et

  • G. F. Swart.
  • Computer Graphi s
  • 1990

Similar Papers

Loading similar papers…