메뉴 건너뛰기




Volumn 30, Issue 5, 2011, Pages 1379-1387

Surface patches from unorganized space curves

Author keywords

Categories and subject descriptors (according to ACM CCS); Computational geometry and object modeling curve; I.3.3 Computer graphics ; I.3.5 Computer graphics ; Object representations; Picture Image generation line and curve generation; Solid; Surface

Indexed keywords


EID: 85014439905     PISSN: 17278384     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1111/j.1467-8659.2011.02012.x     Document Type: Conference Paper
Times cited : (5)

References (28)
  • 1
    • 0012360571 scopus 로고
    • Decomposition method for extracting face topologies from wireframe models
    • Agarwal S. C., Waggenspack W. N.: Decomposition method for extracting face topologies from wireframe models. Computer-Aided Design 24, 3 (1992), 123-140.
    • (1992) Computer-Aided Design , vol.24 , Issue.3 , pp. 123-140
    • Agarwal, S.C.1    Waggenspack, W.N.2
  • 3
    • 0022763841 scopus 로고
    • Automated conversion of curvilinear wire-frame models to surface boundary models; a topological approach
    • New York, NY, USA, SIGGRAPH '86, ACM
    • Brewer Iii J. A., Courter S. M.: Automated conversion of curvilinear wire-frame models to surface boundary models; a topological approach. In Proceedings of of ACM SIGGRAPH 1986 (New York, NY, USA, 1986), SIGGRAPH '86, ACM, pp. 171-178.
    • (1986) Proceedings of of ACM SIGGRAPH 1986 , pp. 171-178
    • Brewer Iii, J.A.1    Courter, S.M.2
  • 4
    • 15344339780 scopus 로고    scopus 로고
    • Minimum cycle bases for network graphs
    • June
    • Berger F., Gritzmann P., De Vries S.: Minimum cycle bases for network graphs. Algorithmica 40 (June 2004), 51-62.
    • (2004) Algorithmica , vol.40 , pp. 51-62
    • Berger, F.1    Gritzmann, P.2    De Vries, S.3
  • 9
    • 15344349581 scopus 로고
    • Applications of Shortest Path Methods
    • PhD thesis, University of Amsterdam
    • De Pina J.: Applications of Shortest Path Methods. PhD thesis, University of Amsterdam, 1995.
    • (1995)
    • De Pina, J.1
  • 11
    • 84943264759 scopus 로고    scopus 로고
    • A polynomial time algorithm to find the minimum cycle basis of a regular matroid
    • Penttonen M., Schmidt E. M., (Eds.), no. 2368 in SWAT '02, Springer Berlin / Heidelberg
    • Golynski A., Horton J.: A polynomial time algorithm to find the minimum cycle basis of a regular matroid. In Proceedings of the 8th Scandinavian Workshop on Algorithm Theory (2002), Penttonen M., Schmidt E. M., (Eds.), no. 2368 in SWAT '02, Springer Berlin / Heidelberg, pp. 200-209.
    • (2002) Proceedings of the 8th Scandinavian Workshop on Algorithm Theory , pp. 200-209
    • Golynski, A.1    Horton, J.2
  • 12
    • 0020818486 scopus 로고
    • From Wire-Frame to solid geometric: Automated conversion of data representations
    • sept
    • Ganter M. A., Uicker J. J.: From Wire-Frame to solid geometric: Automated conversion of data representations. Computers in Mechanical Engineering 2 (sept 1983), 40-45.
    • (1983) Computers in Mechanical Engineering , vol.2 , pp. 40-45
    • Ganter, M.A.1    Uicker, J.J.2
  • 13
    • 0020152483 scopus 로고
    • Creating volume models from edgevertex graphs
    • New York, NY, USA, SIGGRAPH '82, ACM
    • Hanrahan P. M.: Creating volume models from edgevertex graphs. In Proceedings of ACM SIGGRAPH 1982 (New York, NY, USA, 1982), SIGGRAPH '82, ACM, pp. 77-84.
    • (1982) Proceedings of ACM SIGGRAPH 1982 , pp. 77-84
    • Hanrahan, P.M.1
  • 14
    • 0141619358 scopus 로고    scopus 로고
    • Solid model reconstruction of wireframe cad models based on topological embeddings of planar graphs
    • Inoue K., Shimada K., Chilaka K.: Solid model reconstruction of wireframe cad models based on topological embeddings of planar graphs. Journal of Mechanical Design 125, 3 (2003), 434-442.
    • (2003) Journal of Mechanical Design , vol.125 , Issue.3 , pp. 434-442
    • Inoue, K.1    Shimada, K.2    Chilaka, K.3
  • 16
    • 35048830489 scopus 로고    scopus 로고
    • A faster algorithm for minimum cycle basis of graphs
    • et al. J. D., (Ed.), vol. 3142 of Lecture Notes in Computer Science, Springer Berlin / Heidelberg
    • Kavitha T., Mehlhorn K., Michail D., Paluch K.: A faster algorithm for minimum cycle basis of graphs. In Automata, Languages and Programming (2004), et al. J. D., (Ed.), vol. 3142 of Lecture Notes in Computer Science, Springer Berlin / Heidelberg, pp. 97-109.
    • (2004) Automata, Languages and Programming , pp. 97-109
    • Kavitha, T.1    Mehlhorn, K.2    Michail, D.3    Paluch, K.4
  • 18
  • 20
    • 15344346236 scopus 로고    scopus 로고
    • A greedy approach to compute a minimum cycle basis of a directed graph
    • Liebchen C., Rizzi R.: A greedy approach to compute a minimum cycle basis of a directed graph. Information Processing Letters 94, 3 (2005), 107-112.
    • (2005) Information Processing Letters , vol.94 , Issue.3 , pp. 107-112
    • Liebchen, C.1    Rizzi, R.2
  • 21
    • 0019063845 scopus 로고
    • Fleshing out wire frames
    • September
    • Markowsky G., Wesley M. A.: Fleshing out wire frames. IBM J. Res. Dev. 24 (September 1980), 582-597.
    • (1980) IBM J. Res. Dev , vol.24 , pp. 582-597
    • Markowsky, G.1    Wesley, M.A.2
  • 23
    • 84940605935 scopus 로고    scopus 로고
    • Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
    • vol. 1148 of Lecture Notes in Computer Science. Springer-Verlag, May, From the First ACM Workshop on Applied Computational Geometry
    • Shewchuk J. R.: Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator. In Applied Computational Geometry: Towards Geometric Engineering, vol. 1148 of Lecture Notes in Computer Science. Springer-Verlag, May 1996, pp. 203-222. From the First ACM Workshop on Applied Computational Geometry.
    • (1996) Applied Computational Geometry: Towards Geometric Engineering , pp. 203-222
    • Shewchuk, J.R.1
  • 27
    • 77349121027 scopus 로고    scopus 로고
    • A new algorithm for finding faces in wireframes
    • Varley P. A., Company P. P.: A new algorithm for finding faces in wireframes. Computer-Aided Design 42, 4 (2010), 279-309.
    • (2010) Computer-Aided Design , vol.42 , Issue.4 , pp. 279-309
    • Varley, P.A.1    Company, P.P.2


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