Skip to main content

Alternate Pattern Fill

  • Conference paper
Computational and Information Science (CIS 2004)

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

Included in the following conference series:

  • 1184 Accesses

Abstract

An algorithm for alternate pattern fill on arbitrary line segments, circular arcs and elliptical arcs is proposed in this paper. The algorithm creates an external loop which is a minimal loop that contains a given point. And then, all loops that delimit the nested regions for the alternate pattern fill inside the external loop are built. The loop detection is based on a new method for searching the leftmost edges. It requires only values of positions, tangent vectors, curvature radii, and the first derivatives of curvature radii at intersection points and areas of circles and ellipses. After all necessary loops are built, the given pattern is filled in the nested loops inside the external loop. Filling the given pattern in this paper is simplified into filling line segment patterns on some parallel lines.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Angel, E.: Computer Graphics. Addison-Wesley Publishing Company, New York (1990)

    Google Scholar 

  2. Praun, E., Hoppe, H., Webb, M., Finkelstein, A.: Real-Time Htching. In: Proceedings of SIGGRAPH, pp. 581–586 (2001)

    Google Scholar 

  3. Gujar, U., Nagendra, I.: Construction of 3D Solid Objects from Orthographic Views. Computer & Graphics 13, 505–521 (1989)

    Article  Google Scholar 

  4. Satoh, S., Hiroshi, M., Sakauchi, M.: An Efficient Extraction Method for Closed Loops Using a Graph Search Technique. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 78, 583–586 (1995)

    Google Scholar 

  5. Yong, J.H., Hu, S.M., Sun, J.G.: A Note on Approximation of Discrete Data by G1 Arc Splines. Computer-Aided Design 31, 911–915 (1999)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, XX., Yong, JH., Gong, LH., Zheng, GQ., Sun, JG. (2004). Alternate Pattern Fill. In: Zhang, J., He, JH., Fu, Y. (eds) Computational and Information Science. CIS 2004. Lecture Notes in Computer Science, vol 3314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30497-5_173

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30497-5_173

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-30497-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics