Algebraic Number Comparisons for Robust Geometric Operations

نویسندگان

  • John Keyser
  • Koji Ouchi
چکیده

Motivation: Computations with algebraic numbers are of key importance in several geometric computations. Algebraic numbers arise as solutions to systems of polynomials—a common operation in many geometric applications, particularly those involving curved objects. Polynomials regularly describe the relationships between even basic geometric objects, for example the (squared) distance between two points. For more complex curved geometric objects, polynomials are often used to describe the actual shapes. Finding solutions to systems of polynomials thus becomes a key operation in numerous geometric applications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometric Modeling with Algebraic Surfaces

Research in geometric modeling is currently engaged in increasing the geometric coverage to allow modeling operations on arbitrary algebraic surfaces. Operations on models often include Boolean set operations (intersection, union), sweeps and convolutions, convex bull computa· tions, primitive decomposition, surface and volume mesh generatioD, calculation of surface area and volumetric properti...

متن کامل

Sign Determination in Residue Number Systems

Sign determination is a fundamental problem in algebraic as well as geometric computing. It is the critical operation when using real algebraic numbers and exact geometric predicates. We propose an exact and eecient method that determines the sign of a multivariate polynomial expression with rational coeecients. Exactness is achieved by using modular computation. Although this usually requires ...

متن کامل

Sign Determination in Residue Number Systems Herv Br nnimann

Sign determination is a fundamental problem in algebraic as well as geometric computing It is the critical operation when using real algebraic numbers and exact geometric predi cates We propose an exact and e cient method that determines the sign of a multivariate polynomial expression with rational coe cients Exactness is achieved by using modular computation Although this usually requires som...

متن کامل

Exact Geometric Computation: Theory and Applications

This dissertation explores the theory and applications of Exact Geometric Computation (EGC), a general approach to robust geometric computing. The contributions of this thesis are organized into three parts. A fundamental task in EGC is to support exact comparison of algebraic expressions. This leads to the problem of constructive root bounds for algebraic expressions. Such root bounds determin...

متن کامل

Planar shape manipulation using approximate geometric primitives

We present robust algorithms for set operations and Euclidean transformations of curved shapes in the plane using approximate geometric primitives. We use a refinement algorithm to ensure consistency. Its computational complexity is O(n log n + k) for an input of size n with k = O(n) consistency violations. The output is as accurate as the geometric primitives. We validate our algorithms in flo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004