Discrete linear objects in dimension n: The standard model

Graphical Models

Volumn 65, Issue 1-3, 2003, Pages 92-111

  Andres, Eric ^a  

^a Centre National de la Recherche Scientifique   (France)

Author keywords

Digitization; Dimension n; Discrete geometry; m flat; Simplex

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; MATHEMATICAL MODELS;

DISCRETE GEOMETRY; DISCRETE LINEAR OBJECTS;

COMPUTER GRAPHICS;

GRAPHICAL METHOD; IMAGE ANALYSIS;

EID: 0038148690     PISSN: 15240703     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1524-0703(03)00004-3     Document Type: Article

References (34)

1. J. Amanatides, A. Woo, A fast voxel traversal algorithm for ray tracing, in: G. Marechal (Ed.), Proceedings, Eurographics '87, Elsevier, Amsterdam, Netherlands, 1987, pp. 3-9.
2. E. Andres, R. Acharya, C. Sibata, The Supercover 3D Polygon, in: 6th International Workshop on Discrete Geometry for Computer Imagery, Lyon, France, Lecture Notes Comput. Sci., vol. 1176, Springer, New York, 1996, pp. 237-242.
3. E. Andres, M.-A. Jacob, The discrete analytical hyperspheres, IEEE Trans. Visual. Comput. Graph. 3 (1) (1997) 75-86.
4. E. Andres, R. Acharya, C. Sibata, Discrete analytical hyperplanes, Graph. Models Image Process. 59 (15) (1997) 302-309.
5. E. Andres, Ph. Nehlig, J. Francon, Tunnel-Free supercover 3D polygons and polyhedra, in: Proceedings Eurographics '97, Budapest, Hungary, Computer Graphics Forum 16(3), Blackwell Publishers, 1997, C3-C13.
6. E. Andres, Ph. Nehlig, J. Françon, Supercover of straight lines, planes and triangles, in: 7th International Workshop on Discrete Geometry for Computer Imagery, Montpellier, France, Lecture Notes Comput. Sci., vol. 1347, Springer, New York, 1997, pp. 243-253.
7. E. Andreas, Modélisation analytique discrète d'objets géométriques, Habilitation (in french), Laboratoire IRCOM-SIC, University of Poitiers, France, 8 December 2000.
8. E. Andres, R. Breton, P. Lienhardt, SpaMod: design of a spatial modeling tool, in: Digital and Image Geometry, Advanced Lectures-Lecture Notes Comput. Sci., vol. 2243, Springer, New York, 2001. pp. 91-107.
9. E. Andres, Defining discrete objects for polygonalization: the standard model, in: 10th International Workshop on Discrete Geometry for Computer Imagery, Bordeaux, France, Lecture Notes Comput. Sci., vol. 2301, Springer, New York, 2002, pp. 313-325.
10. J.E. Bresenham, Algorithms for computer control of a digital plotter, IBM Syst. J. 4 (1) (1965) 25-30.
11. V.E. Brimkov, E. Andres, R.P. Barneva, Object discretizations in high dimensions and membership recognition, in: 9th International Workshop on Discrete Geometry for Computer Imagery, Uppsala, Sweden, Lecture Notes in Computer Science, vol. 1953, Springer, New York, pp. 210-221.
12. V.E. Brimkov, E. Andres, R.P. Barneva, Object discretizations in high dimensions, Pattern Recog. Lett. 23 (6) (2002) 623-636.
13. D. Cohen, Voxel traversal along a 3D line, in: Paul Heckbert (Ed.), Graphics Gems, vol. IV, Academic Press, Boston, 1994.
14. D. Cohen-Or, A. Kaufman, Fundamentals of surface voxelization, Graph. Models Image Process. 57 (6) (1995) 453-461.
15. D. Cohen-Or, A. Kaufman, T.Y. Kong, On the soundness of surface voxelization, in: T.Y. Kong, A. Rosenfeld (Eds.), Topological Algorithms for Image Processing, 1996, pp. 181-204.
16. D. Cohen-Or, A. Kaufman, 3D line voxelization and connectivity control, IEEE Comput. Graph. Appl. Nov-Dec (1997) 80-87.
17. O. Figueiredo, J.-P. Reveillès, A Contribution to 3D Digital Lines, in: Proceedings 5th International Workshop on Discrete Geometry for Computer Imagery, Clermont-Ferrand, France, 1995, pp. 187-198.
18. J. Françon, Discrete combinatorial surfaces, Graph. Models Image Process. 57 (1995).
19. H. Heijmans, Morphological discretization, in: U. Eckhardt, et al. (Eds.), Geometrical Problems in Image Processing, Akademie Verlag, Berlin, 1991, pp. 91-106.
20. G.T. Herman, Discrete multidimensional jordan surfaces, Graph. Models Image Process. 54 (6) (1992) 507-515.
21. A. Kaufman, Efficient algorithms for 3D scan-conversion of parametric curves, surfaces, and volumes, in: SIGGRAPH '87, Anaheim, USA, Comput. Graph. Forum 21(4) (1987) 171-179.
22. A. Kaufman, Efficient Algorithms for scan-converting 3D polygons, Comput. Graph. 12 (2) (1988) 213-219.
23. A. Kaufman, D. Cohen, R. Yagel, Volume graphics, IEEE Comput. 26 (7) (1993) 51-64.
24. C.E. Kim, Three-dimensional digital line segments, IEEE Trans. Pattern Anal. Mach. Intell. PAMI-5 (1983) 231-234.
25. C.K. Kim, Three-dimensional digital planes, IEEE Trans. Pattern Anal. Mach. Intell. PAMI-6 (5) (1984) 639-645.
26. C. Lincke, W. Wüthrich, Towards a unified approach between digitization of linear objects and discrete analytical objects, in: V. Skala (Ed.), Proceedings WSGG 2000 Workshop, University of West Bohemia, Plzen Tcheque Republic, 2000, pp. 124-131.
27. G.U. Montanari, On limit properties in digitization schemes, J. ACM 17 (2) (1970) 348-360.
28. A. Rosenfeld, T.Y. Kong, A.Y. Wu, Digital surfaces, CGVIP 53 (4) (1991) 305-312.
29. J. Serra, Image Analysis and Mathematical Morphology, Academic Press, London, 1992.
30. I. Stojmenovic, R. Tosic, Digitization schemes and the recognition of digital straight lines, hyperplanes and flats in arbitrary dimensions, in: Contemporary Math Series, Vision Geometry, vol. 119, American Mathematical Society ed., Providence, USA, 1991, pp. 197-212.
31. M. Tajine, D. Wagner, C. Ronse, Hausdorff discretizations and its comparison to other discretization schemes, in: 8th International Workshop on Discrete Geometry for Computer Imagery, Marnela-Vallée, France, Lecture Notes Comput. Sci., vol. 1568, Springer, New York, 1999, pp. 399-410.
32. P. Veelaert, On the flatness of digital hyperplanes, J. Math. Imaging Vision 3 (1993) 205-221.
33. D. Wagner, M. Tajine, C. Ronse, An approach to discretization based on Hausdorff metric, in: Proceedings ISMM '98, (Kluwer ed.), Academic Publishers, New York, 1998, pp. 67-74.
34. C. Wüthrich, A model for curve rasterization in n-dimensional space, Comput. Graph. 22 (2-3) (1998) 153-160.