메뉴 건너뛰기




Volumn 3, Issue 3, 2003, Pages 231-242

Parametric modeling of part family machining process plans from independently generated product data sets

Author keywords

Feature based; Graph matching; Machining process merging; Parametric representation; Part family; Process planning

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTER AIDED DESIGN; COMPUTER SIMULATION; GRAPH THEORY; OPTIMIZATION; PLANNING; PROCESS ENGINEERING;

EID: 0141987670     PISSN: 15309827     EISSN: None     Source Type: Journal    
DOI: 10.1115/1.1602489     Document Type: Article
Times cited : (8)

References (32)
  • 4
    • 0031104114 scopus 로고    scopus 로고
    • Revitalize your product lines through continuous platform renewal
    • Meyer, M. H., 1997, "Revitalize Your Product Lines Through Continuous Platform Renewal," Research Technology Management, 40(2), pp. 17-28.
    • (1997) Research Technology Management , vol.40 , Issue.2 , pp. 17-28
    • Meyer, M.H.1
  • 7
    • 0000737121 scopus 로고    scopus 로고
    • A metric for evaluating design commonality in product families
    • Kota, S., Sethuraman, K., and Miller, R., 2000, "A Metric for Evaluating Design Commonality in Product Families," ASME J. Mech. Des., 122(4), pp. 403-410.
    • (2000) ASME J. Mech. Des. , vol.122 , Issue.4 , pp. 403-410
    • Kota, S.1    Sethuraman, K.2    Miller, R.3
  • 9
    • 0000503812 scopus 로고    scopus 로고
    • Multicriteria optimization in product platform design
    • Nelson, S. A., II, Parkinson, M. B., and Papalambros, P. Y., 2001, "Multicriteria Optimization in Product Platform Design," ASME J. Mech. Des., 123(2), pp. 199-204.
    • (2001) ASME J. Mech. Des. , vol.123 , Issue.2 , pp. 199-204
    • Nelson II, S.A.1    Parkinson, M.B.2    Papalambros, P.Y.3
  • 12
    • 0001671714 scopus 로고
    • The compromise decision support problem and the adaptive linear programming algorithm
    • M. P. Kamat, ed., AIAA, Washington, D.C.
    • Mistree, F., Hughes, O. F., and Bras, B. A., 1993, "The Compromise Decision Support Problem and the Adaptive Linear Programming Algorithm," Structural Optimization: Status and Promise, M. P. Kamat, ed., AIAA, Washington, D.C., pp. 247-289.
    • (1993) Structural Optimization: Status and Promise , pp. 247-289
    • Mistree, F.1    Hughes, O.F.2    Bras, B.A.3
  • 14
    • 0029190859 scopus 로고    scopus 로고
    • On editability of feature-based design
    • Chen, X., and Hoffmann, C. M., 1996, "On Editability of Feature-Based Design," Comput.-Aided Des., 27(12), pp. 905-914.
    • (1996) Comput.-Aided Des. , vol.27 , Issue.12 , pp. 905-914
    • Chen, X.1    Hoffmann, C.M.2
  • 15
    • 0002095059 scopus 로고    scopus 로고
    • Generic naming in generative, constraint-based design
    • Capoyleas, V., Chen, X., and Hoffmann, C. M., 1996, "Generic Naming in Generative, Constraint-Based Design," Comput.-Aided Des., 28(1), pp. 17-26.
    • (1996) Comput.-Aided Des. , vol.28 , Issue.1 , pp. 17-26
    • Capoyleas, V.1    Chen, X.2    Hoffmann, C.M.3
  • 16
    • 0000222870 scopus 로고    scopus 로고
    • A mechanism for persistently naming topological entities in history-based parametric solid models
    • Kripac, J., 1997, "A Mechanism for Persistently Naming Topological Entities in History-Based Parametric Solid Models," Comput.-Aided Des., 29(2), pp. 113-122.
    • (1997) Comput.-Aided Des. , vol.29 , Issue.2 , pp. 113-122
    • Kripac, J.1
  • 18
    • 0033880195 scopus 로고    scopus 로고
    • Semantic feature modeling
    • Bidarra, R., and Bronsvoort, W. F., 2000, "Semantic Feature Modeling," Comput.-Aided Des., 32(3), pp. 201-225.
    • (2000) Comput.-Aided Des. , vol.32 , Issue.3 , pp. 201-225
    • Bidarra, R.1    Bronsvoort, W.F.2
  • 19
    • 0035148112 scopus 로고    scopus 로고
    • Towards valid parametric CAD models
    • Hoffmann, C., and Kim, K.-J., 2001, "Towards Valid Parametric CAD Models," Comput.-Aided Des., 33(1), pp. 81-90.
    • (2001) Comput.-Aided Des. , vol.33 , Issue.1 , pp. 81-90
    • Hoffmann, C.1    Kim, K.-J.2
  • 20
    • 0032178336 scopus 로고    scopus 로고
    • Boundary representation deformation in parametric solid modeling
    • Raghothama, S., and Shapiro, V., (1998), "Boundary Representation Deformation in Parametric Solid Modeling," ACM Trans. Graphics, 17(4), pp. 259-286.
    • (1998) ACM Trans. Graphics , vol.17 , Issue.4 , pp. 259-286
    • Raghothama, S.1    Shapiro, V.2
  • 21
    • 0005283823 scopus 로고    scopus 로고
    • Consistent updates in dual representation systems
    • Raghothama, S., and Shapiro, V., 2000, "Consistent Updates in Dual Representation Systems," Comput.-Aided Des., 32(3), pp. 463-477.
    • (2000) Comput.-Aided Des. , vol.32 , Issue.3 , pp. 463-477
    • Raghothama, S.1    Shapiro, V.2
  • 24
    • 0036643025 scopus 로고    scopus 로고
    • High-level feature recognition using feature relationship graph
    • Huang, Z., and Yip-Hoi, D., 2002, "High-Level Feature Recognition Using Feature Relationship Graph," Comput.-Aided Des., 34(8), pp.561-582.
    • (2002) Comput.-Aided Des. , vol.34 , Issue.8 , pp. 561-582
    • Huang, Z.1    Yip-Hoi, D.2
  • 25
    • 0032598802 scopus 로고    scopus 로고
    • Design of parts for cellular manufacturing using neural network-based approach
    • Onwubolu, G. C., 1999, "Design of Parts for Cellular Manufacturing Using Neural Network-Based Approach," Journal of Intelligent Manufacturing, 10, pp. 251-265.
    • (1999) Journal of Intelligent Manufacturing , vol.10 , pp. 251-265
    • Onwubolu, G.C.1
  • 26
    • 0034499622 scopus 로고    scopus 로고
    • Large machine-part family formation utilizing a parallel ART1 neural network
    • Enke, D., Ratanapan, K., and Dagli, C., 2000, "Large Machine-Part Family Formation Utilizing a Parallel ART1 Neural Network," Journal of Intelligent Manufacturing, 11, pp.591-604.
    • (2000) Journal of Intelligent Manufacturing , vol.11 , pp. 591-604
    • Enke, D.1    Ratanapan, K.2    Dagli, C.3
  • 28
    • 0002603293 scopus 로고
    • Practical graph isomorphism
    • McKay, B. D., 1981, "Practical Graph Isomorphism," Congr. Numer., 30, pp. 45-87.
    • (1981) Congr. Numer. , vol.30 , pp. 45-87
    • McKay, B.D.1
  • 29
    • 0016870630 scopus 로고
    • An algorithm for subgraph isomorphism
    • Ullman, J. R., 1976, "An Algorithm for Subgraph Isomorphism," J. Assoc. Comput. Mach., 23(1), pp. 31-42.
    • (1976) J. Assoc. Comput. Mach. , vol.23 , Issue.1 , pp. 31-42
    • Ullman, J.R.1
  • 30
    • 0002590155 scopus 로고    scopus 로고
    • The maximum clique problem
    • D. Z. Du and P. M. Pardalos, eds.; Kluwer Academic Publishers, Boston, MA
    • Bomze, I., Budinich, M., Pardalos, P., and Pelillo, M., 1999, "The Maximum Clique Problem," Handbook of Combinatorial Optimization, D. Z. Du and P. M. Pardalos, eds., 4, Kluwer Academic Publishers, Boston, MA.
    • (1999) Handbook of Combinatorial Optimization , vol.4
    • Bomze, I.1    Budinich, M.2    Pardalos, P.3    Pelillo, M.4
  • 31
    • 0029255728 scopus 로고
    • Self-organizing hopfield network for attributed relational graph matching
    • Suganthan, P. N., Teoh, E. K., and Mital, D. P., 1995, "Self-Organizing Hopfield Network for Attributed Relational Graph Matching," Image Vis. Comput., 13(1), pp. 61-73.
    • (1995) Image Vis. Comput. , vol.13 , Issue.1 , pp. 61-73
    • Suganthan, P.N.1    Teoh, E.K.2    Mital, D.P.3
  • 32
    • 0003570477 scopus 로고
    • Efficient graph matching algorithms for preprocessed model graphs
    • Ph.D. thesis, University of Bern, Switzerland
    • Messmer, B. T., 1995, "Efficient Graph Matching Algorithms for Preprocessed Model Graphs," Ph.D. thesis, University of Bern, Switzerland.
    • (1995)
    • Messmer, B.T.1


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