Skip to Main content Skip to Navigation
Poster communications

Geometric predicates as arrangements of hypersurfaces: Application to comparison of algebraic numbers

George Tzoumas 1
1 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : A lot of geometric predicates can be formulated as an arrangement of hypersurfaces (algebraic varieties) in a high-dimensional space, where each cell of the arrangement corresponds to an outcome of the predicate, and an evaluation of the predicate maps to point-location queries in this arrangement. To do this successfully, the arrangement has to be decomposed by the aid of subsidiary hypersurfaces, the degree of which plays a fundamental role in the algebraic complexity of the predicate, with respect to the input coefficients. For example, the widely used predicate of root comparison of quadratic polynomials can be mapped to an arrangement of lines and a parabola. For cubics, it becomes an arrangement of planes and a quartic surface, when a monic polynomial of degree d is represented as a point in R^d. Minimizing the degree of the subsidiary equations is an outstanding open problem.
Document type :
Poster communications
Complete list of metadata

https://hal.inria.fr/inria-00538839
Contributor : George Tzoumas <>
Submitted on : Tuesday, November 23, 2010 - 2:06:00 PM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM
Long-term archiving on: : Thursday, February 24, 2011 - 3:11:27 AM

File

poster-a3.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00538839, version 1

Collections

Citation

George Tzoumas. Geometric predicates as arrangements of hypersurfaces: Application to comparison of algebraic numbers. Fall School Shapes, Geometry, and Algebra - SAGA 2010, Oct 2010, Kolympari, Greece. ⟨inria-00538839⟩

Share

Metrics

Record views

207

Files downloads

192