Skip to main content

Finding Breaking Curves in 3D Surfaces

  • Conference paper
  • First Online:
Pattern Recognition and Image Analysis (IbPRIA 2003)

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

Included in the following conference series:

Abstract

In this paper we present a recursive least squares technique for extracting the breaking curve of a 3D range open surface. Unlike differential operators-based methods, the algorithm we propose is robust to noise and is applied to unorganized point sets. No assumptions such as smoothness and/or continuity on the boundary’s shape are performed. The method we present deals with large amount of data under a low computational cost, since no local computation is performed. A global approach is given to the technique in order to make it more robust, faster and simpler than individual point plus neighbours approaches.

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. Bartholomew, D.: Latent Variable Models and Factor Analysis. Charles Griffin and Co. Ltd. (1987)

    Google Scholar 

  2. Bhattacharya, P., Wild, D.: A new edge detector for gray volumetric data. Comput. Biol. Med. 26, 315–328 (1996)

    Article  Google Scholar 

  3. Bolle, R., Cooper, D.: On optimally combining pieces of information, with applications to estimating 3d complex-object position from range data. IEEE Transactions on Pattern Analysis and Machine Intelligence 8(5), 619–638 (1986)

    Article  Google Scholar 

  4. Cooper, D., et al.: Bayesian virtual pot-assembly from fragments as problems in perceptual-grouping and geometric-learning. In: Proceedings of the International Conference on Pattern Recognition (ICPR 2002), Quebec City, Canada. IEEE Computer Society Press, Los Alamitos (2002)

    Google Scholar 

  5. Cooper, D.B., et al.: Assembling virtual pots from 3d measurements of their fragments. In: Proceedings of the International Symposium on Virtual Reality, Archaeology and Cultural Heritage, VAST 2001 (2001)

    Google Scholar 

  6. Garcia, M., Basanez, L.: Fast extraction of surface primitives from range images. In: 13th IAPR International Conference on Pattern Recognition, Vienna, Austria (1996)

    Google Scholar 

  7. Canny, J.F.: A computational approach to edge detection. IEEE trans. Pattern Analisys and Machine Intell. 8(6), 679–698 (1986)

    Article  Google Scholar 

  8. Lejeune, A., Ferrie, F.P.: Finding the parts of objects in range images. Computer Vision and Image Understanding: CVIU 64(2), 230–247 (1996)

    Article  Google Scholar 

  9. Pavlidis, T.: Algorithms for graphics and image processing. Springer, New York (1982)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Orriols, X., Binefa, X. (2003). Finding Breaking Curves in 3D Surfaces. In: Perales, F.J., Campilho, A.J.C., de la Blanca, N.P., Sanfeliu, A. (eds) Pattern Recognition and Image Analysis. IbPRIA 2003. Lecture Notes in Computer Science, vol 2652. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44871-6_79

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-44871-6_79

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40217-6

  • Online ISBN: 978-3-540-44871-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics