Abstract
Prolog is a good tool for implementing computational geometry algorithms. This paper discusses its advantages and disadvantages, and gives examples, including linking chains together, boolean operations on polygons, and cartographic map overlay and reduction. An implementation of polygon intersection proves Prolog to be much more compact and easier to use than Fortran.
This material is based upon work supported by the National Science Foundation under grant no. ECS-8351942, the Rome Air Development Center, contract number, F30602-85-C-0008, subcontract 353-9023-7, and by the Data System Division of the International Business Machines Corp.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Baer, C. Eastman, and M. Henrion, “Geometric Modelling: A Survey”, Computer Aided Design 11 (5), Sept. 1979.
B.G. Baumgart. GEOMED: Geometric Editor, Stanford University STAN-CS-74–414, Also available as NTIS AD-780 452, (May 1974)
B.G. Baumgart. Geometric Modelling for Computer Vision,Stanford University Artificial Intelligence Memo AIM-249,(Oct. 1974)
J.L. Bentley and M.I. Shamos. “Divide And Conquer in Multidimensional Space”, Proc. 16th Annual IEEE Symposium on the Foundations of Computer Science (1975), pp. 220–230
J.W. Boyse. “Interference Detection Among Solids and Surfaces”, Comm. ACM 22 (1), Jan. 1979, pp. 3–9.
I.C. Braid. “The Synthesis of Solids Bounded by Many Faces”, Comm. ACM, (1975).
K.L. Clark and S.-A. Tarnlund. Logic Programming (1982), APIC Studies in Data Processing No 16, Academic Press.
W.F. Clocksin and C.S. Mellish. Programming In Prolog (1981), Springer-Verlag, New York.
H. Coelho, J.C. Cotta, and L.M. Pereira. How to Solve it With Prolog 2nd edition, Ministerio da Habitacao e Obras Publicas, Labatorio Nacional de Engenharia Civil, Lisboa, (1980).
C.M. Eastman and C.I. Yessios, An Efficient Algorithm for Finding the Union, Intersection, and Differences of Spatial Domains Carnegie-Mellon University, Dept. of Computer Science, ( Sept. 1972 ).
W.R. Franklin. “An Exact Hidden Sphere Algorithm That Operates In Linear Time”, Computer Graphics and Image Processing 15, 4, (April 1981), pp. 364–379.
W.R. Franklin. “3-D Geometric Databases Using Hierarchies of Inscribing Boxes”, Proceedings of the 7th Canadian Man-Computer Conference (10–12 June 1981), Waterloo, Ontario, pp. 173–180.
W.R. Franklin. “Efficient Polyhedron Intersection and Union”, Proc. Graphics Interface’82, Toronto, (19–21 May 1982), pp. 73–80.
W.R. Franklin. “A Simplified Map Overlay Algorithm”, Harvard Computer Graphics Conference Cambridge, MA, (31 July - 4 August 1983), sponsored by the Lab for Computer Graphics and Spatial Analysis, Graduate School of Design
W.R. Franklin. “Cartographic Errors Symptomatic of Underlying Algebra Problems”, Proc. International Symposium on Spatial Data Handling vol. 1, (20–24 August 1984), Zurich, Switzerland, pp. 190–208.
J.C. Gonzalez, M.H. Williams, and I.E. Aitchison.“Evaluation of the Effectiveness of Prolog for a CAD Application”, IEEE Computer Graphics and Applications, (March 1984), pp. 67–75.
G. Goos and J. Hartmanis. Lecture Notes in Computer Science 87: 5th Conference on Automated Deduction (1980), Springer-Verlag, New York.
G. Goos and J. Hartmanis. Lecture Notes in Computer Science 138: 6th Conference on Automated Deduction (1982), Springer-Verlag, New York.
K. Maruyama. “A Procedure to Determine Intersections Between Polyhedral Objects”, Int. J. Comput. Infor. Sc. 1 (3), 1972, pp. 255–266.
R.E. Parent. “A System for Sculpting 3-D Data”, Computer Graphics (ACM) 11 (2), (Summer 1977), pp. 138–147.
University of Salford. LISP/PROLOG Reference Manual (March 1984).
P.S.G. Swinson. “Logic Programming: A Computing Tool for the Architect of the Future”, Computer Aided Design 14 (2), (March 1982), pp. 97–104.
P.S.G. Swinson, F.C. N. Periera, and A. Bijl. “A Fact Dependency System for the Logic Programmer”, Computer Aided Design 15 (4), (July 1983), pp. 235–243.
P.S.G. Swinson. “Prolog: A Prelude to a New Generaion of CAAD”, Computer Aided Design 15 (6), (November 1983), pp. 335–343.
J.A. Turner. An Efficient Algorithm for Doing Set Operations on Two-and Three- Dimensional Spatial Objects Architectural Research Laboratory, University of Michigan.
K. Weiler. “Polygon Comparison Using a Graph Representation”, ACM Computer Graphics ACM Computer Graphics 14 (3), (Proc. SIGGRAPH’80), (July 1980), pp. 10–18.
F. Yamaguchi and T. Tokieda. “A Unified Algorithm for Boolean Shape Operations”, IEEE Computer Graphics and Applications 4, (6), (June 1984), pp. 24–37.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Franklin, W.R. (1985). Computational Geometry and Prolog. In: Earnshaw, R.A. (eds) Fundamental Algorithms for Computer Graphics. NATO ASI Series, vol 17. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-84574-1_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-84574-1_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54397-8
Online ISBN: 978-3-642-84574-1
eBook Packages: Springer Book Archive