Skip to main content
SpringerLink
Log in

Layer-based decomposition of solids and its applications

  • original article
  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

In this work we describe a decomposition scheme for polyhedra called layer-based decomposition. This decomposition can be computed in a straightforward way for any kind of polyhedron: convex or nonconvex, genus 0 or higher, etc. and presents interesting properties and applications like point-in-polyhedron inclusion test, computation of Boolean operations, or 3D location. Two methods for computing this decomposition and several of its applications are described in detail, including experimental results and comparisons with alternative approaches.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Akennine-Möller T, Haines E (2002) Real-time rendering, 2nd edn. Peters, Wellesley, MA

  2. Bern M, Eppstein D (1995) Mesh generation and optimal triangulation. In: Computing in Euclidean geometry, 2nd edn. World Scientific, Singapore, pp 189–196

  3. Bern M, Plassmann P (2000) Mesh generation. In: Sack JR, Urrutia J (eds) Handbook of computational geometry. North Holland, Amsterdam, pp 291–332

  4. Feito FR (1995) Modelado de Sólidos y Álgebra de Objetos Gráficos. PhD thesis, Departamento de Lenguajes y Sistemas Informáticos, Universidad de Granada (in Spanish)

  5. Feito FR, Torres JC (1997) Inclusion test for general polyhedra. Comput Graph 21(1):23–30

    Article  Google Scholar 

  6. Feito FR, Rivero ML, Rueda AJ (1999) Boolean representation of general planar polygons. In: Proceedings of WSCG’99, pp 87–92

  7. Foley JD, van Dam A, Feiner SK, Hughes JH (1996) Computer graphics: principles and practice, 2nd edn. Addison-Wesley, Reading, MA

    Google Scholar 

  8. Goodman JE, O’Rourke J (1997) Handbook of discrete and computational geometry. CRC Press, Boca Raton, FL

  9. Rivero ML, Feito FR (2000) Boolean operations on general planar polygons. Comput Graph 24(6):881–896

    Article  Google Scholar 

  10. Rivero ML, Feito FR (2001) Expresiones CSG para sólidos definidos por mallas de triángulos. In: Proceedings of XI Congreso Espańol de Informática Gráfica, pp 341–342 (in Spanish)

  11. Rivero ML (2002) Algoritmos para las operaciones Booleanas en 2D y 3D, bajo un sistema de representación formal. PhD thesis, Departamento de Lenguajes y Sistemas Informáticos, Universidad de Granada (in Spanish)

  12. Rueda AJ, Feito FR, Rivero ML (2002) A triangle-based representation for polygons and its applications. Comput Graph 26(5):805–814

    Article  Google Scholar 

  13. Rueda AJ (2004) Representación de objetos gráficos mediante capas y sus aplicaciones. PhD thesis, Departamento de Lenguajes y Ciencias de la Computación, Universidad de Málaga (in Spanish)

  14. Schneider P, Eberly D (2002) Geometry tools for computer graphics. Morgan Kauffman, San Francisco

Download references

Author information

Authors and Affiliations

  1. Departamento de Informática, Escuela Politécnica Superior, Universidad de Jaén, 23071, Jaén, Spain

    Antonio J. Rueda, Francisco R. Feito & Lidia M. Ortega

Authors
  1. Antonio J. Rueda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francisco R. Feito
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lidia M. Ortega
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Antonio J. Rueda.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rueda, A., Feito, F. & Ortega, L. Layer-based decomposition of solids and its applications. Visual Comput 21, 406–417 (2005). https://doi.org/10.1007/s00371-005-0302-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00371-005-0302-6

Keywords

Search

Navigation