메뉴 건너뛰기




Volumn 38, Issue 7-9, 2003, Pages 945-960

Analysis of STL Files

Author keywords

Polyhedral data structure; Rapid prototyping; STL file

Indexed keywords


EID: 0242507438     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0895-7177(03)90079-3     Document Type: Conference Paper
Times cited : (196)

References (18)
  • 1
    • 0042091884 scopus 로고    scopus 로고
    • A review of rapid prototyping technologies and systems
    • X. Yan and P. Gu, A review of rapid prototyping technologies and systems, Computer-Aided Design 28, 307-318, (1996).
    • (1996) Computer-Aided Design , vol.28 , pp. 307-318
    • Yan, X.1    Gu, P.2
  • 2
    • 0028420109 scopus 로고
    • A data reduction scheme for triangulated surfaces
    • B. Hamann, A data reduction scheme for triangulated surfaces, Computer Aided Geometric Design 11, 197-214, (1994).
    • (1994) Computer Aided Geometric Design , vol.11 , pp. 197-214
    • Hamann, B.1
  • 3
    • 0242395869 scopus 로고    scopus 로고
    • Correcting topological defects of tesselations
    • Edited by F. Fiala, E. Kranakis and J.-R. Sacks, Carleton University Press
    • D. Wang and J.A. Goldak, Correcting topological defects of tesselations, In Canadian Conference on Computational Geometry CCCG, (Edited by F. Fiala, E. Kranakis and J.-R. Sacks), pp. 50-55, Carleton University Press, (1996).
    • (1996) Canadian Conference on Computational Geometry CCCG , pp. 50-55
    • Wang, D.1    Goldak, J.A.2
  • 5
    • 0000925756 scopus 로고
    • Data dependent triangulations for piecewise linear interpolation
    • N. Dyn, D. Levin and S. Rippa, Data dependent triangulations for piecewise linear interpolation, IMA Journal of Numerical Analysis 10, 137-154, (1990).
    • (1990) IMA Journal of Numerical Analysis , vol.10 , pp. 137-154
    • Dyn, N.1    Levin, D.2    Rippa, S.3
  • 8
    • 0032179008 scopus 로고    scopus 로고
    • Shape preserving polyhedral simplification with bounded error
    • P. Veron and J.C. Leon, Shape preserving polyhedral simplification with bounded error, Comput. & Graphics 22, 565-585, (1998).
    • (1998) Comput. & Graphics , vol.22 , pp. 565-585
    • Veron, P.1    Leon, J.C.2
  • 10
    • 0031631745 scopus 로고    scopus 로고
    • Efficient implementation of progressive meshes
    • H. Hoppe, Efficient implementation of progressive meshes, Comput. & Graphics 22, 27-36, (1998).
    • (1998) Comput. & Graphics , vol.22 , pp. 27-36
    • Hoppe, H.1
  • 11
    • 0033874763 scopus 로고    scopus 로고
    • Multi-level models for reverse engineering and rapid prototyping in remote CAD systems
    • A. Fischer, Multi-level models for reverse engineering and rapid prototyping in remote CAD systems, Computer-Aided Design 32, 27-38, (2000).
    • (2000) Computer-Aided Design , vol.32 , pp. 27-38
    • Fischer, A.1
  • 15
    • 84950826016 scopus 로고
    • Computing discrete minimal surfaces and their conjugates
    • U. Pinkall and K. Polthier, Computing discrete minimal surfaces and their conjugates, Experimental Mathematics 2 (1), 16-36, (1993).
    • (1993) Experimental Mathematics , vol.2 , Issue.1 , pp. 16-36
    • Pinkall, U.1    Polthier, K.2
  • 16
    • 0021484348 scopus 로고
    • An algorithm for determining the intersection of two simple polyhedra
    • M. Szilvási-Nagy, An algorithm for determining the intersection of two simple polyhedra, Computer Graphic Forum 3, 219-225, (1984).
    • (1984) Computer Graphic Forum , vol.3 , pp. 219-225
    • Szilvási-Nagy, M.1
  • 17
    • 0022783851 scopus 로고
    • Two algorithms for decomposing a polyhedron into convex parts
    • M. Szilvási-Nagy, Two algorithms for decomposing a polyhedron into convex parts, Computer Graphics Forum 5, 197-202, (1986).
    • (1986) Computer Graphics Forum , vol.5 , pp. 197-202
    • Szilvási-Nagy, M.1


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