Skip to main content
SpringerLink
Log in

SpaMod: Design of a Spatial Modeling Tool

  • Chapter
  • First Online:
Digital and Image Geometry

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

Abstract

The aim of this paper is to present the design of a spatial modeling tool, called SpaMod, that is currently developed in Poitiers (France). SpaMod will allow users to represent and manipulate both discrete and continuous representations of geometrical objects. It is a topology based geometric modeling tool with three types of embeddings: the classical Euclidean embedding, the discrete matrix embedding (voxel or inter-pixel) and the discrete analytical embedding (discrete objects de- fined by inequations). In order for such a tool to fulfill its role, all three embeddings have to be available together. Conversions between embeddings is thus an important however, in 3D, still partially open question.

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

Access this chapter

Log in via an institution
eBook
USD 16.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. Andres E., Discrete Circles, Spheres and Hyperspheres, Comp. & Graphics, Vol. 18, No. 5, 1994, pp. 695–706.

    Google Scholar 

  2. Andres E., Modélisation analytique discrète d’objets géométriques, Habilition, Poitiers University, December2000.

    Google Scholar 

  3. Andres E., Acharya R. and Sibata C., Discrete Analytical Hyperplane, Graphical Models and Image Processing, Vol. 59, No. 5, September 1997, pp. 302–309.

    Article  Google Scholar 

  4. Andres E., Debled-Renesson I., Sibata C., Acharya R and Shin K., Linear Contour Segmentation and its Application to the Computation ofSter eotactic Radiosurgery Dose Distribution, SPIE, Medical Imaging’ 96, New Port Beach-California (USA), SPIE 2710, Image Processing, february 1996.

    Google Scholar 

  5. Andres E., Nehlig P. and Françon J., Supercover ofStr aight Lines, Planes and Triangles, 7th International Workshop on Discrete Geometry for Computer Imagery, Montpellier, France, December 1997, Lecture Notes in Computer Science, No. 1347, pp. 243–254.

    Google Scholar 

  6. Andres E., Nehlig P. and Françon J., Tunnel-Free Supercover 3D Polygons and Polyhedra, Eurographics’97, Budapest, Hungary, 4–8 September 1997. Computer Graphics Forum, Vol. 16 (3), Conference issue, C3-C13.

    Google Scholar 

  7. Andres E., Sibata C. and Acharya R., The Supercover 3D Polygon, 6th International Workshop on Discrete Geometry for Computer Imagery, Lyon, France, November 1996, Lecture Notes in Computer Science, No. 1176, pp. 237–242.

    Google Scholar 

  8. Bresenham J. E., Algorithm for Computer Control of a Digital Plotter, A. C. M. Transaction on Graphics, Vol. 4, No. 1, 1965, pp. 25–30.

    Google Scholar 

  9. Brimkov V. E., Andres E. and Barneva R. P., Object Discretization in Higher Dimensions, 9th International Conference, Uppsala, Sweden, December 2000, Lecture Notes in Computer Science, No. 1953, pp. 210–221.

    Google Scholar 

  10. Brimkov V., Barneva R. and Nehlig P., Optimally Thin Tunnel-Free Triangular Meshes, International Workshop on Volume Graphics, 24–25 March 1999, Swansea, UK, pp. 103–122.

    Google Scholar 

  11. Brisson E., Representing Geometric Structuresin d Dimensions: Topology and Order, Discrete Comput. Geom., No. 9 (1993), pp. 387–426.

    Article  MATH  MathSciNet  Google Scholar 

  12. Debled-Rennesson I., Étude et reconnaissance des droites et plans discrets, Phd thesis, Louis Pasteur University, Strasbourg, France, December 1995.

    Google Scholar 

  13. Debled-Rennesson I. and Reveillès, An Incremental Algorithm for Digital Plane Recognition, 4th International Workshop on Discrete Geometry for Computer Imagery, Grenoble, France, September 1994, DGCI’94, pp. 207–222.

    Google Scholar 

  14. Elter H. and Lienhardt P., Cellular Complexes as Structured Semi-simplicial Sets, International Journal of Shape Modeling, Vol. 1, No. 2 (1994), pp. 191–217.

    Article  MATH  Google Scholar 

  15. Françon J., Topologie de Khalimsky et Kovaleski et algorithmique graphique, 1st Symposium on Discrete Geometry for Computer Imagery, Strasbourg, France, September 1991.

    Google Scholar 

  16. Françon J., Schramm J.-M. and Tajine M., Recognizing Arithmetic Straight Lines and Planes, 6th International Workshop on Discrete Geometry for Computer Imagery, Lyon, France, November 1996, Lecture Notes in Computer Science, No. 1176,pp. 141–150.

    Google Scholar 

  17. Kaufman A., Cohen D. and Yagel R., Volume Graphics, IEEE Computer, Vol. 27, No. 7, July 1993, pp. 51–64.

    Google Scholar 

  18. Kim C. E. and Stojmenović I., On the Recognition ofD igital Planes in Three Dimensional Space, Pattern Recognition Letters, 1991, 12, pp. 612–618.

    Article  Google Scholar 

  19. Kovalevsky V., Digital Geometry Based on the Topology ofA bstract Cell Complexes, 3th International Conference on Discrete Geometry for Computer Imagery, Strasbourg, France, DGCI 1993, pp. 259–284.

    Google Scholar 

  20. Lienhardt P. and Elter H., Different Combinatorial Models Based on the Map Concept for the Representation of Different Types ofCel lular Complexes, Proceedings IFIP TC 5/WG II, Working Conference on Geometric Modeling in Computer Graphics, Genova, Italy, 1993.

    Google Scholar 

  21. Lienhardt P., N-dimensional Generalized Combinatorial Maps and Cellular Quasimanifolds, International Journal of Computational Geometry and Applications, Vol. 4, No. 3, 1994, pp. 275–324.

    Article  MATH  MathSciNet  Google Scholar 

  22. Lienhardt P., Subdivisions ofN-dimensional Space and N-dimensional Generalized Maps, Proceedings 5th Annual A. C. M. Symposium on Computational Geometry, Saarbrüken, Germany, 1989, pp. 228–236.

    Google Scholar 

  23. Lienhardt P., Topological Models for Boundary Representations: a Comparison with N-dimensional Generalized Maps, Computer Aided Design23, 1 (1991), pp. 59–82.

    Article  MATH  Google Scholar 

  24. Lorensen W. E. and Cline H. E., Marching Cube: a High Resolution 3D Surface Construction Algorithm, Computer Graphics21, 4 (1987), pp. 163–169.

    Article  Google Scholar 

  25. Papier L., Polydrisation et visualisation d’objets discrets tridimensionnels, PhD thesis, Louis Pasteur University, Strasbourg, 2000.

    Google Scholar 

  26. Papier L. and Françon J., Évaluation de la normale au bord d’un objet discret 3D, C. F. A. O. and Informatique Graphique, Vol. 13, No. 2, 1998, pp. 205–226.

    Google Scholar 

  27. Papier L. and Françon J., Polyhedrization of the Boundary of a Voxel Object, 8th International Workshop on Discrete Geometry for Computer Imagery, Marne-la-Vallée, France, March 1999, Lecture Notes in Computer Science, No. 1568, pp. 425–434.

    Google Scholar 

  28. Reveillès J.-P., Combinatorial pieces in digital lines and planes, S. P. I. E. Vision Geometry IV, Vol. 2573, 1995.

    Google Scholar 

  29. Reveillès J.-P., Géométrie discrète, calcul en nombres entiers et algorithmique, Habilitation, Louis Pasteur University, Strasbourg, France, December 1991.

    Google Scholar 

  30. Salam I., Nehlig P. and Andres E., Discrete Ray-Casting, 8th International Workshop on Discrete Geometry for Computer Imagery, Marne-la-Vallée, France, March 1999, Lecture Notes in Computer Science, No. 1568, pp. 435–446.

    Google Scholar 

  31. Schramm J. M., Coplanar Tricubes, 7th International Workshop on Discrete Geometry for Computer Imagery, Montpellier, France, December 1997, Lecture Notes in Computer Science, No. 1347, pp. 87–98.

    Google Scholar 

  32. Stojmenović I. and To¡ić R., Digitization schemes and the Recognition ofD igital Straight Lines, Hyperplanes and Flats in Arbitrary dimensions, Contemporary Mathematics, 1991, 119, pp. 197–212.

    Google Scholar 

  33. Tajine M. and Ronse C, Hausdor. Discretizations ofA lgebraic Sets and Diophantine Sets, 9th International Conference, Uppsala, Sweden, December 2000, Lecture Notes in Computer Science, No. 1953, pp. 99–110.

    Google Scholar 

  34. Vialard A., Chemins Euclidiens: un modèle de représentation des contours discrets, Phd thesis, Bordeaux 1 University, 1996.

    Google Scholar 

  35. Vittone J., Caractérisation et reconnaissance de droites et de plans en géométrie discr`ete, Phd thesis, Joseph Fourier-Grenoble 1 University, December 1999.

    Google Scholar 

  36. Vittone J. and Chassery J.-M., Coexistence of Tricubes in Digital Naive Plane, 7th InternationalWorkshop on Discrete Geometry for Computer Imagery, Montpellier, France, December 1997, Lecture Notes in Computer Science, No. 1347, pp. 99–110.

    Google Scholar 

  37. Vittone J. and Chassery J.-M., Recognition ofD igital Naive Planes and Polyhedrization, 9th International Conference, Uppsala, Sweden, December 2000, Lecture Notes in Computer Science, No. 1953, pp. 296–307.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire IRCOM-SIC SP2MI, Université de Poitiers (France), Boulevard Marie et Pierre Curie BP 30179, 86962, Futuroscope-Chasseneuil cedex, France

    Eric Andres, Rodolphe Breton & Pascal Lienhardt

Authors
  1. Eric Andres
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rodolphe Breton
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pascal Lienhardt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Groupe ESIEE, Cité Descartes, 2, Bld. Blaise-Pascal, 93162, Noisy-le-Grand, France

    Gilles Bertrand

  2. Media Technology Division, Chiba University, Inst. of Media and Information Technology, 1-33 Yayoi-cho, Inage-ku, 263-8522, Chiba, Japan

    Atsushi Imiya

  3. The University of Auckland, CITR Tamaki, Tamaki Campus, Morrin Road, Glen Innes, 1005, Auckland, New Zealand

    Reinhard Klette

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Andres, E., Breton, R., Lienhardt, P. (2001). SpaMod: Design of a Spatial Modeling Tool. In: Bertrand, G., Imiya, A., Klette, R. (eds) Digital and Image Geometry. Lecture Notes in Computer Science, vol 2243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45576-0_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-45576-0_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45576-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation