Skip to main content

Arithmetic Discrete Parabolas

  • Conference paper
Advances in Visual Computing (ISVC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 4292))

Included in the following conference series:

Abstract

In the present paper, we propose a new definition of discrete parabolas, the so-called arithmetic discrete parabolas. We base our approach on a non-constant thickness function and characterized the 0-connected and 1-connected parabolas in terms of thickness function. This results extend the well-known characterization of the Îș-connectedness of arithmetic discrete lines, depending on the norm || \(\textperiodcentered\)|| ∞  and || \(\textperiodcentered\)||1 of their normal vector.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Bresenham, J.E.: Algorithm for computer control of a digital plotter. IBM Systems Journal 4(1), 25–30 (1965)

    Article  Google Scholar 

  2. Freeman, H.: Computer processing of line-drawing images. ACM Computing Surveys 6(1), 57–97 (1974)

    Article  MATH  Google Scholar 

  3. Rosenfeld, A.: Digital straight lines segments. IEEE Transactions on Computers, 1264–1369 (1974)

    Google Scholar 

  4. ReveillĂšs, J.P.: GĂ©omĂ©trie discrĂšte, calcul en nombres entiers et algorithmique. ThĂšse d’état, UniversitĂ© Louis Pasteur, Strasbourg (1991)

    Google Scholar 

  5. Debled-Rennesson, I., Reveillùs, J.P.: A linear algorithm for segmentation of digital curves. IJPRAI 9(4), 635–662 (1995)

    Google Scholar 

  6. Cohen-Or, D., Kaufman, A.E.: Fundamentals of surface voxelization. CVGIP: Graphical Model and Image Processing 57(6), 453–461 (1995)

    Article  Google Scholar 

  7. Andres, E., Nehlig, P., Françon, J.: Supercover of straight lines, planes and triangles. In: Ahronovitz, E. (ed.) DGCI 1997. LNCS, vol. 1347, pp. 243–257. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  8. Andres, E.: ModĂ©lisation Analytique DiscrĂšte d’Objets GĂ©omĂ©triques. Habilitation ĂĄ diriger des recherches, UniversitĂ© de Poitiers (2000)

    Google Scholar 

  9. Fiorio, C., Jamet, D., Toutant, J.L.: Discrete circles: an arithmetical approach with non- constant thickness. In: Latecki, L.J., Mount, D.M. (eds.) Vision Geometry XIV, Electronic Imaging, San Jose (CA), USA, SPIE, vol. 6066 (2006); 0C–1–0C–12

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Debled-Rennesson, I., Domenjoud, E., Jamet, D. (2006). Arithmetic Discrete Parabolas. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2006. Lecture Notes in Computer Science, vol 4292. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11919629_49

Download citation

  • DOI: https://doi.org/10.1007/11919629_49

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics