Skip to main content

Implicit Curves: From Discrete Extraction to Applied Formalism

  • Conference paper
  • First Online:
ICGG 2022 - Proceedings of the 20th International Conference on Geometry and Graphics (ICGG 2022)

Abstract

This paper addresses the issue of visualizing the right information among large data sets by proposing to represent raw data as a set of mathematically-based implicit curves. Implicit curves are proving to be a powerful yet underused tool. The methodology we propose not only allows a more relevant visualization of information, but also a faster and efficient access to it: (1) since curves are extracted and compressed during precomputation, real-time rendering is possible on the end-user’s computer, even for very large datasets; (2) this property can be extended by enabling real-time data access and transfer at the server level – i.e. simultaneously saving local storage costs and increasing raw data security. Our proposal also achieved a high compression ratio (3%) while maintaining the visual significance of the data and reducing discrete artifacts such as curve gaps and pixel aliasing. We based our tests using two-dimensional height maps, but extending it to more dimensions is not a problem since we can consider any two-dimensional slice in these data.

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 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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

Notes

  1. 1.

    Where the compression rate is defined as explained in Sect. 2.3.

  2. 2.

    The notation \([\![a,b]\!]\) denotes the closed integer interval from a to b.

  3. 3.

    For simplification purpose we suppose that values of V are equidistant, which is true in our case since \(I = [\![0,255]\!]\).

References

  1. Cai, C., Harrington, P.D.B., Davis, D.M.: Two-dimensional Fourier compression. Anal. Chem. 69(20), 4249–4255 (1997)

    Article  Google Scholar 

  2. Catmull, E., Rom, R.: A class of local interpolating splines. In: Barnhill, R.E., Riesenfeld, R.F. (eds.) Computer Aided Geometric Design, pp. 317–326. Academic Press (1974). https://www.sciencedirect.com/science/article/pii/B9780120790500500205

  3. Chalupa, D., Balaghan, P., Hawick, K.A., Gordon, N.A.: Computational methods for finding long simple cycles in complex networks. Know.-Based Syst. 125(C), 96–107 (2017)

    Article  Google Scholar 

  4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)

    MATH  Google Scholar 

  5. Da Costa, J., Germain, C., Baylou, P.: Level curve tracking algorithm for textural feature extraction. In: Proceedings 15th International Conference on Pattern Recognition. ICPR-2000, vol. 3, pp. 909–912 (2000)

    Google Scholar 

  6. Dacorogna, B., Tanteri, C.: Advanced analysis for engineers. (Analyse avancée pour ingénieurs.). Enseignement des Mathématiques (PPUR), Presses Polytechniques et Universitaires Romandes, Lausanne (2002)

    Google Scholar 

  7. Debled-Rennesson, I., Jean-Luc, R., Rouyer-Degli, J.: Segmentation of discrete curves into fuzzy segments. Electron. Not. Discrete Mathem. 12, 372–383 (2003). 9th International Workshop on Combinatorial Image Analysis

    Article  MathSciNet  Google Scholar 

  8. Debled-Rennesson, I., Reveilles, J.P.: A linear algorithm for segmentation of digital curves. IJPRAI 9, 635–662 (1995)

    Google Scholar 

  9. Freeman, H.: On the encoding of arbitrary geometric configurations. IRE Trans. Electron. Comput. EC–10(2), 260–268 (1961)

    Article  MathSciNet  Google Scholar 

  10. Marty, M., et al.: Real-time renderings of multidimensional massive datacubes on jupyter notebook (2022)

    Google Scholar 

  11. Seidel, R.: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Comput. Geom. 1(1), 51–64 (1991)

    Article  MathSciNet  Google Scholar 

  12. Shannon, C.: Communication in the presence of noise. Proc. IRE 37(1), 10–21 (1949)

    Article  MathSciNet  Google Scholar 

  13. Yuksel, C., Schaefer, S., Keyser, J.: Parameterization and applications of catmull-rom curves. Comput. Aided Des. 43(7), 747–755 (2011). the 2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by the Swiss Space Office/SEFRI, grant number ‘REF-1131-61001’ as a part of the Enhanced Data Cube Visualisation for Earth Observation project relative to the tasks planned with the European Space Agency (ESA). We would like to thank the seven members of the data scientist advisory group from the Gisat, ViTO, TU Wien, EURAC, Terrasigan, NASA, and ESA institutes for their support and advice. Special thanks are also due to Gutierrez Montserrat for the precious English review of the manuscript.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Stéphane Gobron .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Marty, M. et al. (2023). Implicit Curves: From Discrete Extraction to Applied Formalism. In: Cheng, LY. (eds) ICGG 2022 - Proceedings of the 20th International Conference on Geometry and Graphics. ICGG 2022. Lecture Notes on Data Engineering and Communications Technologies, vol 146. Springer, Cham. https://doi.org/10.1007/978-3-031-13588-0_62

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-13588-0_62

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-13587-3

  • Online ISBN: 978-3-031-13588-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics