Advertisement

The Midpoint Locus of a Triangle in a Corner

  • Daniel Lichtblau
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6877)

Abstract

We are given an equilateral triangle with vertices constrained to lie in each of the three positive octant coordinate planes (colloquially, “a triangle in a corner”). We wish to describe the locus of points covered by the midpoint of the triangle, as the vertices range over configurations allowed by the above constraint. This locus comprises a solid region. We use numerical and graphical methods, and also computational algebra, to find the boundary surface and visualize this locus.

Keywords

Constraint geometry implicit surfaces nonlinear systems 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chibisov, D., Mayr, E.W., Pankratov, S.: Spatial Planning and Geometric Optimization: Combining Configuration Space and Energy Methods. In: Hong, H., Wang, D. (eds.) ADG 2004. LNCS (LNAI), vol. 3763, pp. 156–168. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  2. 2.
    Gleason, A.M., Greenwood, R.E., Kelly, L.M.: The William Lowell Putnam Mathematical Competition Problems and Solutions: 1938-1964. Mathematical Association of America (1980)Google Scholar
  3. 3.
    Jerrard, R.P., Wetzel, J.E.: Tile in a corner. Mathematics Magazine 82, 300–309 (2009)CrossRefzbMATHGoogle Scholar
  4. 4.
    Lazard, D., Rouillier, F.: Solving parametric polynomial systems. Journal of Symbolic Computation 42, 636–667 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Lichtblau, D.: Computing Curves Bounding Trigonometric Planar Maps: Symbolic and Hybrid Methods. In: Hong, H., Wang, D. (eds.) ADG 2004. LNCS (LNAI), vol. 3763, pp. 70–91. Springer, Heidelberg (2006), http://library.wolfram.com/infocenter/Conferences/7516/ CrossRefGoogle Scholar
  6. 6.
    Lichtblau, D.: Implicitization via the Gröbner walk (2007), slides: http://library.wolfram.com/infocenter/Conferences/7512/
  7. 7.
    Lichtblau, D.: Polynomial GCD and factorization via approximate Gröbner bases. In: SYNASC 2010: 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 29–36. IEEE Press (2010)Google Scholar
  8. 8.
    Ruiz, O.E., Ferreira, P.M.: Algebraic geometry and group theory in geometric constraint satisfaction. In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC 1994, pp. 224–233. ACM, New York (1994)Google Scholar
  9. 9.
    Tran, Q.-N.: Efficient Groebner walk conversion for implicitization of geometric objects. Computer Aided Geometric Design 21, 837–857 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Wolfram Research. Mathematica 7 (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Daniel Lichtblau
    • 1
  1. 1.Wolfram Research, Inc.ChampaignUSA

Personalised recommendations