Recent progress in exact geometric computation

C. Li, S. Pion, C. K. Yap

Research output: Contribution to journalArticlepeer-review


Computational geometry has produced an impressive wealth of efficient algorithms. The robust implementation of these algorithms remains a major issue. Among the many proposed approaches for solving numerical non-robustness, Exact Geometric Computation (EGC) has emerged as one of the most successful. This survey describes recent progress in EGC research in three key areas: constructive zero bounds, approximate expression evaluation and numerical filters.

Original languageEnglish (US)
Pages (from-to)85-111
Number of pages27
JournalJournal of Logic and Algebraic Programming
Issue number1
StatePublished - Jul 2005


  • Approximate expression evaluation
  • C++ libraries
  • Constructive zero bounds
  • Exact geometric computation
  • Interval arithmetic
  • Non-robustness problems
  • Numerical filters
  • Precision-driven computation
  • Robust algorithms

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Logic
  • Computational Theory and Mathematics


Dive into the research topics of 'Recent progress in exact geometric computation'. Together they form a unique fingerprint.

Cite this