메뉴 건너뛰기




Volumn 246, Issue 1-2, 2000, Pages 73-105

Thin discrete triangular meshes

Author keywords

Discrete geometry; Discrete triangle; Mesh of triangles

Indexed keywords


EID: 0000091541     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00346-6     Document Type: Article
Times cited : (23)

References (30)
  • 1
    • 0004314811 scopus 로고
    • Thèse de doctorat, Université Louis Pasteur, Strasbourg, December (e-mail: andres@sic.univ-poitiers.fr)
    • E. Andres, Cercles discrets et rotations discrètes, Thèse de doctorat, Université Louis Pasteur, Strasbourg, December 1992 (e-mail: andres@sic.univ-poitiers.fr).
    • (1992) Cercles Discrets et Rotations Discrètes
    • Andres, E.1
  • 3
    • 0031553020 scopus 로고    scopus 로고
    • Tunnel-free supercover 3D polygons and polyhedra
    • Eurographics 97, Budapest, Hungary (conf. issue)
    • E. Andres, P. Nehlig, J. Françon, Tunnel-free supercover 3D polygons and polyhedra, Eurographics 97, Budapest, Hungary (conf. issue) Comput. Graph. Forum 16 (3) (1997) C3-C13.
    • (1997) Comput. Graph. Forum , vol.16 , Issue.3
    • Andres, E.1    Nehlig, P.2    Françon, J.3
  • 4
    • 84957688942 scopus 로고    scopus 로고
    • Supercover of straight lines, planes and triangles
    • Discrete Geometry for Computer Imagery, 7th Internat. Workshop, Montpellier, France, Springer, Berlin
    • E. Andres, P. Nehlig, J. Françon, Supercover of straight lines, planes and triangles, in: Discrete Geometry for Computer Imagery, 7th Internat. Workshop, Montpellier, France, Lecture Notes in Computer Science, vol. 1347, Springer, Berlin, 1997, pp. 243-254.
    • (1997) Lecture Notes in Computer Science , vol.1347 , pp. 243-254
    • Andres, E.1    Nehlig, P.2    Françon, J.3
  • 5
    • 0002349614 scopus 로고
    • Algorithm for computer control of a digital plotter
    • J.E. Bresenham, Algorithm for computer control of a digital plotter, ACM Trans. Graph. 4 (1) (1965) 25-30.
    • (1965) ACM Trans. Graph. , vol.4 , Issue.1 , pp. 25-30
    • Bresenham, J.E.1
  • 6
    • 0003807263 scopus 로고
    • Thèse de doctorat, Université Louis Pasteur, Strasbourg, December (e-mail: debled@dpt-info.u-strasbg.fr)
    • I. Debled-Renesson, Reconnaissance des droites et plans discrets, Thèse de doctorat, Université Louis Pasteur, Strasbourg, December 1995 (e-mail: debled@dpt-info.u-strasbg.fr).
    • (1995) Reconnaissance des Droites et Plans Discrets
    • Debled-Renesson, I.1
  • 9
    • 0002473026 scopus 로고
    • A contribution to 3D digital lines
    • 5th Internat. Workshop, Clermont-Ferrand, France, September 25-27
    • O. Figueiredo, J.-P. Reveillès, A contribution to 3D digital lines, in: Discrete Geometry for Computer Imagery, 5th Internat. Workshop, Clermont-Ferrand, France, September 25-27, 1995, pp. 187-198.
    • (1995) Discrete Geometry for Computer Imagery , pp. 187-198
    • Figueiredo, O.1    Reveillès, J.-P.2
  • 12
    • 0030109036 scopus 로고    scopus 로고
    • Sur la topologie d'un plan arithmetique
    • 19XX
    • J. Françon, Sur la topologie d'un plan arithmetique, Theoret. Comput. Sci. 156 (19XX) 159-176.
    • Theoret. Comput. Sci. , vol.156 , pp. 159-176
    • Françon, J.1
  • 13
    • 84948968814 scopus 로고    scopus 로고
    • Recognizing arithmetic straight lines and planes
    • Discrete Geometry for Computer Imagery, 6th Internat. Workshop, Lyon, France, Springer, Berlin
    • J. Françon, J.-M. Schramm, M. Tajine, Recognizing arithmetic straight lines and planes, in: Discrete Geometry for Computer Imagery, 6th Internat. Workshop, Lyon, France, Lecture Notes in Computer Science, vol. 1176, Springer, Berlin, 1996, pp. 141-150.
    • (1996) Lecture Notes in Computer Science , vol.1176 , pp. 141-150
    • Françon, J.1    Schramm, J.-M.2    Tajine, M.3
  • 15
    • 0003776027 scopus 로고
    • Fast polygonal approximation of terrains and height fields
    • Carnegie Mellon University, 52 pp.
    • P.S. Heckbert, M. Garland, Fast polygonal approximation of terrains and height fields, Tech. Rep. CMU-CS-95-181, Carnegie Mellon University, 1995, 52 pp.
    • (1995) Tech. Rep. CMU-CS-95-181
    • Heckbert, P.S.1    Garland, M.2
  • 17
    • 0002768477 scopus 로고
    • An algorithm for 3D scan conversion of polygons
    • Amsterdam, The Netherlands, August
    • A. Kaufman, An algorithm for 3D scan conversion of polygons, Proc. Eurographics'87, Amsterdam, The Netherlands, August 1987, pp. 197-208.
    • (1987) Proc. Eurographics'87 , pp. 197-208
    • Kaufman, A.1
  • 18
    • 0023381060 scopus 로고
    • An algorithm for 3D scan conversion of parametric curves, surfaces, and volumes
    • A. Kaufman, An algorithm for 3D scan conversion of parametric curves, surfaces, and volumes, Comput. Graph. 21 (4) (1987) 171-179.
    • (1987) Comput. Graph. , vol.21 , Issue.4 , pp. 171-179
    • Kaufman, A.1
  • 19
    • 0004257671 scopus 로고
    • IEEE Computer Society Press, Los Alamitos
    • A. Kaufman (Ed.), Volume visualization, IEEE Computer Society Press, Los Alamitos, 1990.
    • (1990) Volume Visualization
    • Kaufman, A.1
  • 20
    • 0000892326 scopus 로고
    • Normal estimation in 3D discrete space
    • A. Kaufman, D. Cohen, R. Yagel, Normal estimation in 3D discrete space, The Visual Comput. (1992) (8) 278-291.
    • (1992) The Visual Comput. , Issue.8 , pp. 278-291
    • Kaufman, A.1    Cohen, D.2    Yagel, R.3
  • 22
    • 84957710644 scopus 로고    scopus 로고
    • Topology-preserving deletion of 1's from 2-, 3- and 4-dimensional binari images
    • Discrete Geometry for Computer Imagery, 6th Internat. Workshop, Lyon, France, Springer, Berlin
    • T.Y. Kong, Topology-preserving deletion of 1's from 2-, 3- and 4-dimensional binari images, in: Discrete Geometry for Computer Imagery, 6th Internat. Workshop, Lyon, France, Lecture Notes in Computer Science, vol. 1347, Springer, Berlin, 1996, pp. 3-18.
    • (1996) Lecture Notes in Computer Science , vol.1347 , pp. 3-18
    • Kong, T.Y.1
  • 23
    • 84877841188 scopus 로고
    • Subdivisions of n-dimensional space and n-dimensional generalized maps
    • Saarbrüken, Germany
    • P. Lienhardt, Subdivisions of n-dimensional space and n-dimensional generalized maps, Proc. 5th ACM Conf. Comput. Geometry, Saarbrüken, Germany, 1989, pp. 228-236.
    • (1989) Proc. 5th ACM Conf. Comput. Geometry , pp. 228-236
    • Lienhardt, P.1
  • 24
    • 0012996404 scopus 로고
    • Algorithms of discretization of algebraic spatial curves on homogeneous cubical grids
    • W. Mokrzycki, Algorithms of discretization of algebraic spatial curves on homogeneous cubical grids, Comput. Graph. 12 (3/4) (1988) 477-487.
    • (1988) Comput. Graph. , vol.12 , Issue.3-4 , pp. 477-487
    • Mokrzycki, W.1
  • 25
  • 27
    • 21944442627 scopus 로고    scopus 로고
    • Coplanar Tricubes
    • Discrete Geometry for Computer Imagery, 7th Internat. Workshop, Montpellier, France, Springer, Berlin
    • J.-M. Schramm, Coplanar Tricubes, in: Discrete Geometry for Computer Imagery, 7th Internat. Workshop, Montpellier, France, Lecture Notes in Computer Science, vol. 1347, Springer, Berlin, 1997, pp. 87-98.
    • (1997) Lecture Notes in Computer Science , vol.1347 , pp. 87-98
    • Schramm, J.-M.1
  • 28
    • 84957644713 scopus 로고    scopus 로고
    • Coexistence of tricubes in digital naive plane
    • Discrete Geometry for Computer Imagery, 7th Internat. Workshop, Montpellier, France, Springer, Berlin
    • J. Vitonne, J.-M. Chassery, Coexistence of tricubes in digital naive plane, in: Discrete Geometry for Computer Imagery, 7th Internat. Workshop, Montpellier, France, Lecture Notes in Computer Science, vol. 1347, Springer, Berlin, 1997, pp. 99-110.
    • (1997) Lecture Notes in Computer Science , vol.1347 , pp. 99-110
    • Vitonne, J.1    Chassery, J.-M.2
  • 29
    • 0001327106 scopus 로고
    • Fourier method of linear programming and its dual
    • H.P. Williams, Fourier method of linear programming and its dual, Amer. Math. Monthly 93 (9) (1986) 59-67.
    • (1986) Amer. Math. Monthly , vol.93 , Issue.9 , pp. 59-67
    • Williams, H.P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.