Skip to main content

Geometry in Prolog

  • Conference paper
Advanced Computer Graphics

Abstract

The Prolog language is a useful tool for geometric and graphics implementations because its primitives, such as unification, match the requirements of many geometric algorithms. We have implemented several problems in Prolog including a subset of the Graphics Kernel Standard, convex hull finding, planar graph traversal, recognizing groupings of objects, and boolean combinations of polygons using multiple precision rational numbers. Certain paradigms, or standard forms, of geometric programming in Prolog are becoming evident. They include applying a function to every element of a set, executing a procedure so long as a certain geometric pattern exists, and using unification to propagate a transitive function. Certain strengths and weaknesses of Prolog for these applications are now apparent.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  • Bruderlin, Beat (1985) “Using Prolog for Constructing Geometric Objects Defined by Constraints,” Eurocal 85, Conference Proceedings, Linz, Austria. Institut fü Informatik, ETH Zürich, CH-8092, Zürich, Switzerland

    Google Scholar 

  • Clocksin, W.F. and Mellish, C.S. (1981) Programming In Prolog, Springer-Verlag, New York.

    MATH  Google Scholar 

  • Coelho, H., Cotta, J.C., and Pereira, L.M. (1980) How to Solve it With Prolog, 2nd edition, Ministerio da Habitacao e Obras Publicas, Labatorio Nacional de Engenharia Civil, Lisboa.

    Google Scholar 

  • Franklin, Wm. Randolph (July 1980) “A Linear Time Exact Hidden Surface Algorithm,” ACM Computer Graphics, vol. 14, no. 3, pp. 117–123. Proceedings of SIGGRAPH′80

    Article  Google Scholar 

  • Franklin, Wm. Randolph (19–21 May 1982) “Efficient Polyhedron Intersection and Union,” Proc. Graphics Interface′82, pp. 73–80, Toronto.

    Google Scholar 

  • Franklin, Wm. Randolph (20–24 August 1984) “Cartographic Errors Symptomatic of Underlying Algebra Problems,” Proc. International Symposium on Spatial Data Handling, vol. 1, pp. 190–208, Zürich, Switzerland.

    Google Scholar 

  • Franklin, Wm. Randolph and Wu, Peter Y.F. (July 1985) Convex Hull and Polygon Intersection Implemented in Prolog, Rensselaer Polytechnic Institute, Troy, NY.

    Google Scholar 

  • Gonzalez, J.C., Williams, M.H., and Aitchison, I.E. (March 1984) “Evaluation of the Effectiveness of Prolog for a CAD Application,” IEEE Computer Graphics and Applications, pp. 67–75.

    Google Scholar 

  • Moss, Chris and Fogel, Earl (June 1985) Tests to Distinguish Various Implementations of Cut in Prolog, Imperial College and Logicware Inc.. Reported on Usenet in Net.lang.Prolog, message-id <1742@utecfa.UUCP>.

    Google Scholar 

  • Nichols, Margaret (August 1985) The Graphic Kernal System in Prolog, ECSE Dept., Rensselaer Polytechnic Institute, Masters Thesis, Troy, NY.

    Google Scholar 

  • Roberts, Grant (1984) Waterloo Core Prolog Users Manual (version 1.5), Intralogic Inc., Waterloo, Ont, Canada.

    Google Scholar 

  • Salford, University of (March 1984), LISP/PROLOG Reference Manual.

    Google Scholar 

  • Samaddar, Sumitro (August 1985) An Expert System for Photo Interpretation, ECSE Dept., Rensselaer Polytechnic Institute, Masters Thesis, Troy, NY.

    Google Scholar 

  • Sammut, Claude (1983) UNSW Prolog User Manual, University of New South Wales (Australia).

    Google Scholar 

  • Spivey, J. M. (March 1983), University of York Portable Prolog System (Release 1) User’s Guide, York, U.K..

    Google Scholar 

  • Swinson, P.S.G. (March 1982) “Logic Programming: A Computing Tool for the Architect of the Future,” Computer Aided Design, vol. 14, no. 2, pp. 97–104.

    Article  Google Scholar 

  • Swinson, P.S.G. (November 1983) “Prolog: A Prelude to a New Generation of CAAD,” Computer Aided Design, vol. 15, no. 6, pp. 335–343.

    Article  Google Scholar 

  • Swinson, P.S.G., Periera, F.C.N., and Bijl, A. (July 1983) “A Fact Dependency System for the Logic Programmer,” Computer Aided Design, vol. 15, no. 4, pp. 235–243.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Tokyo

About this paper

Cite this paper

Franklin, W.R., Nichols, M., Samaddar, S., Wu, P. (1986). Geometry in Prolog. In: Kunii, T.L. (eds) Advanced Computer Graphics. Springer, Tokyo. https://doi.org/10.1007/978-4-431-68036-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-4-431-68036-9_6

  • Publisher Name: Springer, Tokyo

  • Print ISBN: 978-4-431-68038-3

  • Online ISBN: 978-4-431-68036-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics