Geometric containment, common roots of polynomials and partial orders

  • N. Santoro
  • J. B. Sidney
  • S. J. Sidney
  • J. Urrutia
Contributed Papers Geometrical Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 294)


The reduction to vector dominance of two unrelated problems is studied; the two problems are
  1. 1.

    Geometric containment: given a class of geometric figures, determine for any two figures in the class whether one is contained in the other (perhaps after translation, rotation and even reflection).

  2. 2.

    Common roots of polynomials: given a class of polynomials, determine for any two polynomials in the class whether they have positive common roots.


A general characterization of the relationship between geometric containment and properties of finite parametrizations of geometric figures is given in the form of an abstract theorem on partial orders. It is shown that the existing impossibility result for rectangles can be formulated as an instance of the abstract result.

The abstract result is then applied to some other classes of figures, and several instances are given using a known low-dimensional negative result to obtain a new higher-dimensional one.

The abstract theorem is then used to prove that domination of polynomials is not reducible to vector dominance even for the restricted class of quadratic polynomials.


Partial Order Quadratic Polynomial Geometric Figure Isosceles Triangle Abstract Theorem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BFM]
    B.S. Baker, S.J. Fortune, S.R. Mahaney, “Polygon containment under translation”, J. of Algorithms 7 (1986), 532–548.Google Scholar
  2. [C1]
    B.M. Chazelle, "Optimal algorithms for computing depths and layers", Proc. 21th Allerton Conf. on Communication, Control and Computing, Monticello, Oct. 1983, 427–436.Google Scholar
  3. [C2]
    B.M. Chazelle, "The polygon containment problem", Advances of Computing Research 1, 1–33.Google Scholar
  4. [CK]
    D.A. Chand, S.S. Kapur, "An algorithm for convex polytopes", J. of the ACM 17 (1970), 78–86.Google Scholar
  5. [EO]
    H. Edelsbrunner, M.H. Overmars, "On the equivalence of some rectangle problems", Information Processing Letters 14 (1982), 124–127.Google Scholar
  6. [GY]
    R.L. Graham, F.F. Yao, "Finding the convex hull of a simple polygon", J. of Algorithms 4 (1983), 324–331.Google Scholar
  7. [GNO]
    R.H. Guting, O. Nurmi, T. Ottman, "The direct dominance problem", Proc.1st Symp. on Computational Geometry, June 1985, 81–88.Google Scholar
  8. [KLP]
    H.T. Kung, F. Luccio, F.P. Preparata, "On finding the maxima of a set of vectors", J. of the ACM 22 (1975), 469–476.Google Scholar
  9. [KS1]
    D.G. Kirkpatrick, R. Seidel, "The ultimate planar convex hull algorithm?", SIAM J. on Computing 15 (1986), 287–299.Google Scholar
  10. [KS2]
    D.G. Kirkpatrick, R. Seidel, "Output-seize sensitive algorithms for finding maximal vectors", Proc.1st Symp. on Comput. Geometry, June 1985, 89–96.Google Scholar
  11. [LP]
    D.T. Lee, F.P. Preparata, "An improved algorithm for the rectangle enclosure problem", J. of Algorithms 3 (1982), 218–224.Google Scholar
  12. [PH]
    F.P. Preparata, S.J. Hong, "Convex hulls of finite sets of points in two and three dimensions", Communications of the ACM (1977), 87–93.Google Scholar
  13. [Se]
    R. Seidel, "Constructing higher-dimensional convex hulls at logarithmic cost per face", Proc. 18th ACM Symp. on Theory of Computing, May 1986, 404–413.Google Scholar
  14. [Sh]
    N.K. Shinja, Control Systems, Holt Reinehart & Wiston, 1986.Google Scholar
  15. [SSSU]
    N. Santoro, J.B. Sidney, S.J. Sidney, J. Urrutia, "Geometric containment and vector dominance", Theoretical Computer Science, to appear; preliminary version in Proc.2nd Symp. on Theoretical Aspects of Computer Science, Saarbrucken, Jan. 1985, 322–327.Google Scholar
  16. [U]
    J. Urrutia, "Parial orders and Euclidian geometry", in Algorithms and Order, (I. Rival ed.), Reidel, 1987.Google Scholar
  17. [VW]
    V. Vaishnavi, D. Wood, "Data structures for rectangle containment and enclosure problems', Computer Graphics and Image processing 13 (1980), 372–384.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • N. Santoro
    • 1
  • J. B. Sidney
    • 2
  • S. J. Sidney
    • 3
  • J. Urrutia
    • 4
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada
  2. 2.Faculty of AdministrationUniversity of OttawaOttawaCanada
  3. 3.Department of MathematicsUniversity of ConnecticutStorrsUSA
  4. 4.Depatment of Computer ScienceUniversity of OttawaOttawaCanada

Personalised recommendations