Skip to main content

Symbolic analysis of planar drawings

  • Computational Geometry
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 358))

Abstract

A method is described for performing a symbolic analysis of planar drawings. The method takes input in the form of a dimensioned (i.e. labeled) drawing and determines whether the coordinates of all of the points in the drawing can be uniquely written in terms of the specified labels. If it is possible to determine the coordinates of the points (i.e. the drawing is consistently dimensioned), then they are calculated. Otherwise the algorithm returns a flag specifying whether the drawing is underdimensioned or over-dimensioned. The method employes standard constructions from geometry such as the construction of a line from two distinct points or the construction of a line from a given line, a point and an angle. In order to determine whether some sequence of given constructions can be used to calculate the coordinates of each point we construct and analyse an undirected graph called the dimension graph of the drawing. If such a sequence exists, then the calculations are performed by calling symbolic routines which correspond to the various constructions. An implementation is described and examples are given.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. American Mathematics Monthly, October 1987, p 750.

    Google Scholar 

  2. Chou, Shang-Ching, Proving and Discovering Theorems in Elementary Geometry using Wu's Method, Ph.D. Thesis, Dept. of Mathematics, Univ. of Texas, Austin, 1985.

    Google Scholar 

  3. Freudenthal, H and Bauer A., Geometry — A Phenomenological Discussion, in Fundamentals of Mathematics, vol. 2, (ed. Behake et al), MIT Press, 1974

    Google Scholar 

  4. Kapur, D. Geometry Theorem Proving using Hilbert's Nullstellensatz, proc. 1986 Symposium on Symbolic and Algebraic Computation, ACM (B. Char, ed.).

    Google Scholar 

  5. Kutzler, B. and Stifter, S., Automated Geometry Theorem Proving using Buchberger's Algorithm, proc. 1986 Symposium on Symbolic and Algebraic Computation, ACM (B. Char, ed.).

    Google Scholar 

  6. Smith, C. and Soiffer N., MathScribe: A User Interface for Computer Algebra Systems, proc. 1986 Symposium on Symbolic and Algebraic Computation, ACM (B. Char, ed.).

    Google Scholar 

  7. Todd, Philip, A K-Tree Generalisation which Characterises Consistency of Dimensioned Engineering Drawings, submitted SIAM Journal of Algebraic and Discrete Methods.

    Google Scholar 

  8. Wu, W., On the Decision Problem and the Mechanization of Theorem-Proving in Elementary Geometry, Scientia Sinica 21, p. 150–172.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

P. Gianni

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Todd, P.H., Cherry, G.W. (1989). Symbolic analysis of planar drawings. In: Gianni, P. (eds) Symbolic and Algebraic Computation. ISSAC 1988. Lecture Notes in Computer Science, vol 358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51084-2_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-51084-2_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51084-0

  • Online ISBN: 978-3-540-46153-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics