Skip to main content

Polygon Optimisation for the Modelling of Planar Range Data

  • Conference paper
  • 1981 Accesses

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

Abstract

In this paper we present efficient and fast algorithms for the reconstruction of scenes or objects using range image data. Assuming that a good segmentation is available, we concentrate on the polygonisation, triangulation and optimisation, i.e. both triangle reduction and adaptive edge filtering to improve edge linearity. In the processing, special attention is given to complex edge junctions. In a last step, vertex neighbourhoods are analysed in order to robustly attribute depth to the triangle list from the noisy range data.

This is a preview of subscription content, log in via an institution.

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hoover, A., Jean-Baptiste, G., Jiang, X., Flynn, P.J., Bunke, H., Goldgof, D.B., Bowyer, K., Eggert, D.W., Fitzgibbon, A., Fisher, R.B.: An experimental comparison of range image segmentation algorithms. IEEE Trans. Pattern Anal. Machine Intell. 18(7), 673–689 (1996)

    Article  Google Scholar 

  2. Jiang, X., Bowyer, K., Morioka, Y., Hiura, S., Sato, K., Inokuchi, S., Bock, M., Guerra, C., Loke, R., du Buf, J.: Some further results of experimental comparison of range image segmentation algorithms. In: Proc. 15th ICPR, Barcelona, Spain, September 3-8, vol. 4, pp. 877–881 (2000)

    Google Scholar 

  3. Loke, R., du Buf, J.: Segmentation of range images in a quadtree. In: Perales, F.J., Campilho, A.C., Pérez, N., Sanfeliu, A. (eds.) IbPRIA 2003. LNCS, vol. 2652, pp. 428–436. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Khalifa, I., Moussa, M., Kamel, M.: Range image segmentation using local approximation of scan lines with application to CAD model acquisition. Machine Vision and Applications 13, 263–274 (2003)

    Article  Google Scholar 

  5. O’Rourke, J.: Computational Geometry in C. Cambridge University Press, Cambridge (1996)

    Google Scholar 

  6. Min, J.: Package of evaluation framework for range image segmentation algorithms, Available at: http://marathon.csee.usf.edu/range/seg-comp/SegComp.html , Univ. of South Florida

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nunes, S., Almeida, D., Loke, E., du Buf, H. (2005). Polygon Optimisation for the Modelling of Planar Range Data. In: Marques, J.S., Pérez de la Blanca, N., Pina, P. (eds) Pattern Recognition and Image Analysis. IbPRIA 2005. Lecture Notes in Computer Science, vol 3522. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11492429_16

Download citation

  • DOI: https://doi.org/10.1007/11492429_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26153-7

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics