Skip to main content

The implementation of fill area for GKS

  • Conference paper
Fundamental Algorithms for Computer Graphics

Part of the book series: NATO ASI Series ((SSE,volume 17))

  • 402 Accesses

Abstract

The paper describes the generation of a GKS fill area by a series of hatch lines. The complexity of the problem and the effect of sorting is discussed. Two methods of sorting both of which generate lists are described, code is presented and performance is discussed. Two methods of handling corners are described and Fortran 77 code is presented for the complete algorithm using one method.

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.

References

  1. GKS 7.4: ISO TC97/SC5/WG2 N262, International Standard ISO 7942 (draft), Information Processing Systems — Computer Graphics — Graphical Kernel System (GKS) Functional Description, 1984.

    Google Scholar 

  2. GKS 7.2: Draft International Standard ISO/DIS 7942, Information Processing Systems — Computer Graphics — Graphical Kernel System (GKS) Functional Description, 1983.

    Google Scholar 

  3. C3] GKS Fortran binding: ISO/TC97/SC5/WG2 N316, Information Processing Systems — Computer Graphics — Graphical Kernel System (GKS) Language Bindings, Part 1: FORTRAN, 1984.

    Google Scholar 

  4. A J Matthew, Polygonal Clipping of Polylines, to be published in Computer Graphics Forum.

    Google Scholar 

  5. J D Foley, A Van Dam, Fundementals of interactive computer graphics, Adison—Wesley Systems Programming Series, 1983, ISBN 0–201–14468–9.

    Google Scholar 

  6. W M Newman, R F Sproull, Principles of interactive computer graphics, McGraw—Hill computer science series, 1979, ISBN 0–07–046338–7.

    Google Scholar 

  7. D E Knuth, The Art of Computer Programming, Volume 3, Sorting and Searching, Addison—Wesley series in Computer Science and Information Processing, 1973, ISBM 0–201–03803—X.

    Google Scholar 

  8. W J Cody, Basic Concepts for Computational Software, Argonne National Laboratory, Technical Memorandum No. 360, 1980.

    Google Scholar 

  9. D Bailey, D M Valiance, N D H Ross, The University of Salford FNT77 Reference Manual, University of Salford, 1983.

    Google Scholar 

  10. Fortran 77, ISO 1539 Programming Languages — FORTRAN.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cartledge, C.J., Weeks, G.H. (1985). The implementation of fill area for GKS. 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_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-84574-1_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54397-8

  • Online ISBN: 978-3-642-84574-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics