Review of Computer Engineering Research

Published by: PAK Publishing Group
Online ISSN: 2410-9142
Print ISSN: 2412-4281
Total Citation: 11

No. 1

Perturbation Functions for Compact Database

Pages: 30-37
Find References

Finding References


Perturbation Functions for Compact Database

Search :
Google Scholor
Search :
Microsoft Academic Search
Cite

DOI: 10.18488/journal.76.2017.41.30.37

Sergey I. Vyatkin

Export to    BibTeX   |   EndNote   |   RIS

  1. J. Bloomental, Introduction to implicit surfaces/ (Eds.). San Francisco, CA, USA: Morgan Kaufmann Publishers Inc, 1997.
  2. A. Ricci, "A constructive geometry for computer graphics," Computer Journal, vol. 16, pp. 157-160, 1973. View at Google Scholar | View at Publisher
  3. W. P. Wang and K. K. Wang, "Geometric modeling for swept volume of moving solids," IEEE Computer Graphics and Applications, vol. 6, pp. 8–17, 1986. View at Google Scholar | View at Publisher
  4. C. M. Hoffman, " Implicit curves and surfaces in CAGD," IEEE Computer Graphics Application, vol. 13, pp. 79-88, 1993. View at Google Scholar | View at Publisher
  5. S. Sclaroff and A. Pentland, "Generalized implicit functions for computer graphics," Computer Graphics, vol. 25, pp. 247-250, 1991. View at Google Scholar | View at Publisher
  6. M. P. Gascuel, "An implicit formulation for precise contact modeling between flexible solids," in Siggraph’93, Computer Graphics Proceedings, 1993, pp. 313-320.
  7. B. Wyvill, C. McPheeters, and G. Wyvil, "Animating soft objects," Visual Comput., vol. 2, pp. 235-242, 1986. View at Google Scholar 
  8. J. F. Hughes, "Scheduled fourier volume morphing," Computer Graphics, vol. 26, pp. 43-46, 1992. View at Google Scholar | View at Publisher
  9. S. I. Vyatkin, "Complex surface modeling using perturbation functions," Optoelectronics, Instrumentation and Data Processing, vol. 43, pp. 226-231, 2007. View at Google Scholar | View at Publisher
  10. S. I. Vyatkin and B. S. Dolgovesov, "Collision detection of functionally defined objects for constant time," in Proc. of 15-th International Conference on Computer Graphics GraphiCon ’2005 (Novosibirsk, June 20-24, 2005), 2005, pp. 164-169.
  11. S. I. Vyatkin, "An interactive system for modeling, animating and rendering of functionally defined objects," American Journal of Computer Science and Engineering Survey, vol. 2, p. 102−108, 2014. View at Google Scholar 
  12. S. I. Vyatkin, "Method of binary search for image elements of functionally defined objects using graphics processing units," Optoelectronics, Instrumentation and Data Processing, vol. 50, pp. 606–612, 2014. View at Google Scholar | View at Publisher
  13. S. I. Vyatkin, "Polygonization method for functionally defined objects," International Journal of Automation, Control and Intelligent Systems, vol. 1, p. 1−8, 2015. View at Google Scholar 
  14. Y. Gary and T. Grey, "Robust creation of implicit surfaces from polygonal meshes," IEEE Transactions on Visualization and Computer Graphics, vol. 8, pp. 346-359, 2002. View at Google Scholar | View at Publisher
  15. S. I. Vyatkin, "Converting polygonal models to function-based objects," International Scientific-Technical Magazine Measuring and Computing Devices in Technological Processes, vol. 1, p. 146−150, 2008.
No any video found for this article.
(2017). Perturbation Functions for Compact Database. Review of Computer Engineering Research, 4(1): 30-37. DOI: 10.18488/journal.76.2017.41.30.37
3D Objects based on perturbation functions are considered in this paper.  For shape creating a set of algorithms and software based on function-defined surfaces that perform an interactive rate and enable intuitive operations was proposed. Interactive modification of the 3D objects allows us to provide high level of detail leading to a photo-realistic appearance of the resulting shapes.

Contribution/ Originality
This study uses a new technique for free-form representation created by mean of the analytical functions which have the following advantages: fewer data for mapping curvilinear surfaces (short database description), fewer geometric operations, simple animation and deformation of surfaces.

Solving Nonlinear Single-Unit Commitment Problem by Genetic Algorithm Based Clustering Technique

Pages: 11-29
Find References

Finding References


Solving Nonlinear Single-Unit Commitment Problem by Genetic Algorithm Based Clustering Technique

Search :
Google Scholor
Search :
Microsoft Academic Search
Cite

DOI: 10.18488/journal.76.2017.41.11.29

M.A. El-Shorbagy , A.A. Mousa , M. Farag

Export to    BibTeX   |   EndNote   |   RIS

  1. A. J. Wood and B. F. Wollenberg, Power generation, operation and control. New York: John Wiley & Sons, 1996.
  2. X. H. Guan, P. B. Luh, H. Yan, and J. A. Amalfi, "An optimization-based method for unit commitment," International Journal of Electrical Power & Energy Systems, vol. 14, pp. 9–17, 1992. View at Google Scholar | View at Publisher
  3. Y. W. Jeong, J. B. Park, J. R. Shin, and K. Y. Lee, "A thermal unit commitment approach using an improved quantum evolutionary algorithm," Electric Power Components and Systems, vol. 37, pp. 770–786, 2009. View at Google Scholar | View at Publisher
  4. N. P. Padhy, "Unit commitment-A bibliographical survey," IEEE Transactions on Power Systems, vol. 19, pp. 1196–1205, 2004.View at Google Scholar | View at Publisher
  5. T. Senjyu, T. Miyagi, A. Y. Saber, N. Urasaki, and T. Funabashi, "Emerging solution of large-scale unit commitment problem by stochastic priority list," Electrical Power and Energy Systems, vol. 76, pp. 283–292, 2006. View at Google Scholar | View at Publisher
  6. A. Rong, H. Hakonen, and R. Lahdelma, "A dynamic regrouping based sequential dynamic programming algorithm for unit commitment of combined heat and power systems," Energy Conversion and Management, vol. 50, pp. 1108–1115, 2009. View at Google Scholar | View at Publisher
  7. C. L. Chen and S. C. Wang, "Branch-and-bound scheduling for thermal generating units," IEEE Trans. Energy Convers, vol. 8, pp. 184- 189, 1993.View at Google Scholar | View at Publisher
  8. P. K. Singhal, "Generation scheduling methodology for thermal units using lagrangian relaxation," in Proc. 2nd IEEE Int. Conf. Current  Trends in Technology, 2011, pp. 1-6.
  9. A. Frangioni, C. Gentile, and F. Lacalandra, "Tighter approximated MILP formulations for unit commitment problems," IEEE Transactions on Power Systems, vol. 24, pp. 105–113, 2009. View at Google Scholar | View at Publisher
  10. G. B. Sheble and G. N. Fahd, "Unit commitment literature synopsis," IEEE Transactions on Power Systems, vol. 9, pp. 128–135, 1993. View at Google Scholar | View at Publisher
  11. K. Swarup and P. Simi, "Neural computation using discrete and continuous Hopfield networks for power system economic dispatch and unit commitment," Neurocomputing, vol. 70, pp. 119–129, 2006. View at Google Scholar | View at Publisher
  12. S. A. Kazarlis, A. G. Bakirtzis, and V. Petridis, "A genetic algorithm solution to the unit commitment problem," IEEE Transactions on Power Systems, vol. 11, pp. 29–36, 1996. View at Google Scholar | View at Publisher
  13. M. A. El-Shorbagy, A. A. Mousa, and S. M. Nasr, "A chaos-based evolutionary algorithm for general nonlinear programming problems," Chaos, Solitons and Fractals, vol. 85, pp. 8–21, 2016. View at Google Scholar | View at Publisher
  14. C. Dang and M. Li, "A floating-point genetic algorithm for solving the unit commitment problem," European Journal of Operational Research, vol. 181, pp. 1370-1395, 2007. View at Google Scholar | View at Publisher
  15. W. F. Abd El-Wahed, A. A. Mousa, and M. A. El-Shorbagy, "Integrating particle swarm optimization with genetic algorithms for solving nonlinear optimization problems," Journal of Computational and Applied Mathematics, vol. 235, pp. 1446–1453, 2011. View at Google Scholar | View at Publisher
  16. D. Datta, "Unit commitment problem with ramp rate constraint using a binary-real-coded genetic algorithm," Applied Soft Computing, vol. 13, pp. 3873–3883, 2013. View at Google Scholar | View at Publisher
  17. K. A. Juste, H. Kita, E. Tanaka, and J. Hasegawa, "An evolutionary programming solution to the unit commitment problem," IEEE Transactions on Power Systems, vol. 14, pp. 1452-1459, 1999.View at Google Scholar | View at Publisher
  18. N. Simopoulos, S. Kavatza, and C. Vournas, "Unit commitment by an enhanced simulated annealing algorithm," IEEE Transactions on Power Systems, vol. 21, pp. 68–76, 2006. View at Google Scholar | View at Publisher
  19. A. H. Mantawy, Y. L. Abdel-Magid, and S. Z. Selim, "Integrating  genetic algorithms, tabu search, and simulated annealing for the unit commitment problem," IEEE Transactions on Power Systems, vol. 14, pp. 829 -836, 1999. View at Google Scholar | View at Publisher
  20. J. Ebrahimi, S. H. Hosseinian, and G. B. Gharehpetian, "Unit commitment problem solution using shuffled frog leaping algorithm," IEEE Transactions on Power Systems, vol. 26, pp. 573 - 581, 2011. View at Google Scholar | View at Publisher
  21. A. A. Mousa, M. A. El-Shorbagy, and W. F. Abd El-Wahed, "Local search based hybrid particle swarm optimization for multiobjective optimization," International Journal of Swarm and Evolutionary Computation, vol. 3, pp. 1-14, 2012. View at Google Scholar | View at Publisher
  22. A. H. Mantawy, Y. L. Abdel-Magid, and S. Z. Selim, "Unit commitment by Tabu search," IEE Proceedings-Generation, Transmission and Distribution, vol. 145, pp. 56–64, 1998. View at Google Scholar | View at Publisher
  23. M. M. El-Saadawi, M. A. Tantawi, and E. Tawfik, "A fuzzy optimization-based approach to large scale thermal unit commitment," Electric Power Systems Research, vol. 72, pp. 245–252, 2004. View at Google Scholar | View at Publisher
  24. Y. Pourjamal and S. N. Ravadanegh, "HSA based solution to the UC problem," International Journal of Electrical Power & Energy Systems, vol. 46, pp. 211-220, 2013. View at Google Scholar | View at Publisher
  25. K. Chandrasekaran, S. Hemamalini, S. P. Simon, and N. P. Padhy, "Thermal unit commitment using binary/real coded artificial bee colony algorithm," Electric Power Systems Research, vol. 84, pp. 109-119, 2012.View at Google Scholar | View at Publisher
  26. M. Sudhakaran1 and P. Ajay-D-Vimal Raj, "Integrating genetic algorithms and tabu search for unit commitment problem," International Journal of Engineering, Science and Technology, vol. 2, pp. 57-69, 2010. View at Google Scholar 
  27. R. Nayak and J. Sharma, "A hybid neural network and simulated annealing approach to the unit commitment problem," Computers & Industrial Engineering, vol. 26, pp. 461-477, 2000. View at Google Scholar | View at Publisher
  28. T. Sum-Im, "Lagrangian relaxation combined with differential evolution algorithm for unit commitment problem," Emerging Technology and Factory Automation (ETFA) IEEE, pp. 1–6, 2014.
  29. C. C. A. Rajan and M. R. Mohan, "An evolutionary programming-based tabu search method for solving the unit commitment problem," IEEE Transactions on Power Systems, vol. 19, pp. 577–585, 2004. View at Google Scholar | View at Publisher
  30. R. Todosijević, M. Mladenović, S. Hanafi, and I. Crιvits, "VNS based heuristic for solving the unit commitment problem," Electronic Notes in Discrete Mathematics, vol. 39, pp. 153–160, 2012.View at Google Scholar | View at Publisher
  31. V. N. Dieu and W. Ongsakul, "Enhanced merit order and augmented Lagrange Hopfield network for hydrothermal scheduling," Electrical Power and Energy Systems, vol. 30, pp. 93–101, 2008 View at Google Scholar | View at Publisher
  32. P. K. Singhal, R. Naresh, and V. Sharma, "A novel strategy-based hybrid binary artificial bee colony algorithm for unit commitment problem," Arabian Journal for Science and Engineering, vol. 40, pp. 1455-1469, 2015. View at Google Scholar | View at Publisher
  33. X. J. Zheng, "Optimal dispatching methods for unit commitment based on hybrid genetic-simulated annealing algorithm," Applied Mechanics and Materials, vol. 463, pp. 1076-1080, 2013.
  34. Z. Michalewiz, Genetic algorithms+data structures=evolution programs, 3rd ed.: Springer-Verlag, 1996.
  35. M. Verma, M. Srivastava, N. Chack, A. K. Diswar, and N. Gupta, "A comparative study of variou clustering algorithms in data mining," International Journal of Engineering Reserch and Applications (IJERA), vol. 2, pp. 1379-1384, 2012. View at Google Scholar 
  36. S. Levine, I. Pilowski, and D. M. Boulton, "The classication of depression by numerical taxonomy," British Journal of Psychiatry, vol. 115, pp. 937-945, 1969. View at Google Scholar | View at Publisher
  37. S. Dolnicar, "Using cluster analysis for market segmentation-typical misconceptions, established methodological weaknesses and some recommendations for improvemen, University of Wollongong Research Online," 2003.
  38. F. R. Hodson, Numerical typology and prehistoric archaeology, In F.R. Hodson, D.G. Kendall, and P.A. Tautu, editors, Mathematics in the Archaeological and Historical Sciences. Edinburgh: University Press, 1971.
  39. D. Pratima, N. Nimmakanti, and P. Recognition, "Algorithms for cluster identification problem," Special Issue of International Journal of Computer Science & Informatics (IJCSI), vol. 2, pp. 2231–5292, 2011.
  40. K. S. H. Doreswamy, "Similarity based cluster analysis on engineering materials data sets," Advances in Intelligent Systems and Computing, vol. 167, pp. 161-168, 2012. View at Google Scholar | View at Publisher
  41. D. Dilts, J. Khamalah, and A. Plotkin, "Using cluster analysis for medical resource decision making," Cluster Analysis for Resource Decisions, vol. 15, pp. 333-347, 1995. View at Google Scholar | View at Publisher
  42. C. C. Aggarwal and C. K. Reddy, Data clustering algorithms and applications. New York (USA): CRC Press Taylor & Francis Group, 2014.
  43. K. Arai and X. Q. Bu, "ISODATA clustering with parameter (Threshold for Merge and Split) estimation based on GA: Genetic algorithm," Reports of the Faculty of Science and Engineering, vol. 36, pp. 17-23, 2007. View at Google Scholar 
  44. R. T. Ng and J. Han, "CLARANS: A method for clustering objects for spatial data mining," IEEE Transactions Knowledge Data Engineering, vol. 14, pp. 1003–1016, 2002. View at Google Scholar 
  45. D. Judd, P. K. McKinley, and A. K. Jain, "Large-scale parallel data clustering," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 20, pp. 871-876, 1998. View at Google Scholar 
  46. D. R. Edlaa and P. K. Janaa, "A prototype-based modified DBSCAN for gene clustering," Procedia Technology, vol. 6, pp. 485–492, 2012. View at Google Scholar | View at Publisher
  47. Y. Rani, Manju, and H. Rohil, "Comparative analysis of BIRCH and CURE hierarchical clustering algorithm using WEKA 3.6.9," SIJ Transactions on Computer Science Engineering & its Applications (CSEA), vol. 2, pp. 25-29, 2014. View at Google Scholar 
  48. J. B. MacQueen, "Some methods for classification and analysis of multivariate observation," in Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, University of California Press, 1967, pp. 281-297.
  49. R. P. Priya, N. Sivaraj, and M. Muruganandam, "A solution to unit commitment problem with V2G using harmony search algorithm," International Journal of Advanced Research in Electrical, Electronics and Instrumentation Engineering, vol. 4, pp. 1208-1214, 2015. View at Google Scholar | View at Publisher
  50. D. E. Goldberg, Genetic algorithms in search, optimization and machine learning. Reading, MA: Addison Wesley, 1989.
  51. IEEE Trans. Syst. Man Cybern., vol. 16, pp. 122–128, 1986. View at Google Scholar | View at Publisher
  52. M. Sakthi and A. S. Thanamani, "An effective determination of initial centroids in K-means clustering using kernel PCA," International Journal of Computer Science and Information Technologies, vol. 2, pp. 955-959, 2011. View at Google Scholar 
  53. A. Jain, "Data clustering: 50 years beyond k-means," Pattern Recognition Letters, vol. 31, pp. 651–666, 2010. View at Google Scholar | View at Publisher
  54. A. Kumar and N. N. Jani, "Network design problem using genetic algorithm- an empirical study on selection operator," International Journal of Computer Science and Applications (IJCSA), vol. 3, pp. 48-52, 2010. View at Google Scholar 
  55. W. Xing and F. F. Wu, "Genetic algorithm based unit commitment with energy contracts," International Journal of Electrical Power & Energy Systems, vol. 24, pp. 329-336, 2002. View at Google Scholar | View at Publisher
  56. M. Gen, R. Cheng, and L. Lin, Network models and optimization: Multi-objective genetic algorithm approach: Springer Science & Business Media, 2008.
  57. Y. W. Jeong, W. N. Lee, H. H. Kim, J. B. Park, and J. R. Shin, "Thermal unit commitment using binary differential evolution," Journal of Electrical Engineering & Technology, vol. 4, pp. 323–329, 2009. View at Google Scholar | View at Publisher
  58. A. S. Uyar, B. Tόrkay, and A. Keles, "A novel differential evolution application to shortterm electrical power generation scheduling," Electrical Power and Energy Systems, vol. 33, pp. 1236–1242, 2011.View at Google Scholar | View at Publisher
  59. X. Yuan, A. Su, H. Nie, Y. Yuan, and L. Wang, "Application of enhanced discrete Differentia evolution approach to unit commitment problem," Energy Conversion & Management, vol. 50, pp. 2449–2456, 2009. View at Google Scholar | View at Publisher
  60. R. N. Mohd and J. Geraghty, "Genetic algorithm performance with different selection strategies in solving TSP," in Proceedings of the World Congress on Engineering II, 2011.
  61. R. Sivaraj and T. Ravichandran, "A review of selection methods in genetic algorithm," International Journal of Engineering Science and Technology, vol. 3, pp. 3792-3797, 2011. View at Google Scholar 
  62. G.-H. Tzeng and J.-J. Huang, Fuzzy multiple objective decision making: Chapman and Hall/CRC Press, 2013.
  63. C. A. Anderson, K. F. Jones, and J. Ryan, "A two-dimensional genetic algorithm for the ising problem," Complex Systems, vol. 5, pp. 327- 333, 1991. View at Google Scholar 
  64. C.-P. Cheng and C. W. Liu, "Unit commitment by annealing genetic algorithm," International Journal Electrical Power & Energy Systems, vol. 24, pp. 149–158, 2002. View at Google Scholar | View at Publisher
  65. L. Sun, Y. Zhang, and C. Jiang, "A matrix real-coded genetic algorithm to the unit commitment problem," Electric Power Systems Research, vol. 76, pp. 716–728, 2006. View at Google Scholar | View at Publisher
  66. T. Senjyu, H. Yamashiro, K. Uezato, and T. Funabashi, "A unit commitment problem by using genetic algorithm based on unit characteristic classification," IEEE Power Engineering Society Winter Meeting, vol. 1, pp. 58 - 63, 2002.
  67. S. Kumar and R. Naresh, "Efficient real coded genetic algorithm to solve the non-convex hydrothermal scheduling problem," Electrical Power and Energy Systems, vol. 29, pp. 738–747, 2007. View at Google Scholar | View at Publisher
  68. C.-P. Cheng, C.-W. Liu, and C.-C. Liu, "Unit commitment by Lagrangian relaxation and genetic algorithms," IEEE Transactions on Power Systems, vol. 15, pp. 707–714, 2000. View at Google Scholar | View at Publisher
  69. I. Damousis, A. Bakirtzis, and P. Dokopoulos, "A solution to the unit-commitment problem using integer-coded genetic algorithm," IEEE Transactions on Power Systems, vol. 19, pp. 1165–72, 2004. View at Google Scholar | View at Publisher
No any video found for this article.
(2017). Solving Nonlinear Single-Unit Commitment Problem by Genetic Algorithm Based Clustering Technique. Review of Computer Engineering Research, 4(1): 11-29. DOI: 10.18488/journal.76.2017.41.11.29
Nonlinear single-unit commitment problem (NSUCP) is a NP-hard nonlinear mixed-integer optimization problem, encountered as one of the toughest problems in power systems. This paper presents a new algorithm for solving NSUCP using genetic algorithm (GA) based clustering technique. The proposed algorithm integrates the main features of binary-real coded GA and K-means clustering technique. Clustering technique divides population into a specific number of subpopulations. In this way, different operators of GA can be used instead of using one operator to the whole population to avoid the local minima and introduce diversity. The effectiveness of the proposed algorithm is validated by comparison with other well-known techniques.  By comparison with the previously reported results, it is found that the performance of the proposed algorithm quite satisfactory.

Contribution/ Originality
This study presents a new algorithm for solving nonlinear single-unit commitment problem using genetic algorithm based clustering technique; where it integrates the main features of binary-real coded genetic algorithm and K-means clustering technique. The tests demonstrated that the proposed approach has a satisfactory performance compared to previous studies.

Computational Modeling of Multi-Purpose Amphibious Aircraft Be-103

Pages: 1-10
Find References

Finding References


Computational Modeling of Multi-Purpose Amphibious Aircraft Be-103

Search :
Google Scholor
Search :
Microsoft Academic Search
Cite

DOI: 10.18488/journal.76/2017.4.1/76.1.1.10

Iftikhar B. Abbasov , V iacheslav V. Orekhov

Export to    BibTeX   |   EndNote   |   RIS

  1. L. Silveira and N. Santos, "The marina of Horta (Azores islands)–impacts on the local population and in the tourism development," presented at the 7th International Coastal & Marine Tourism Congress, Section 1, 2012.
  2. Z. Marusic, D. Bartulovic, and A. Rukavina, "Hydro aviation model in purpose of improving the tourist transport to Islands," Suvremeni Promet-Modern Traffic, vol. 33, pp. 147-149, 2013. View at Google Scholar  
  3. S. S. Sarakinos, I. M. Valakos, and I. K. Nikolos, "A software tool for generic parameterized aircraft design," Advances in Engineering Software, vol. 38, pp. 39–49, 2007. View at Google Scholar | View at Publisher
  4. R. Haimes and M. Drela, "On the construction of aircraft conceptual geometry for high-fidelity analysis and design," presented at the 50th AIAA Aerospace Sciences Meeting Including the New Horizons Fo-rum and Aerospace Exposition 2012, Article number AIAA 2012-0683. USA, 2012.
  5. F. H. Darwish, G. M. Atmeh, and Z. F. Hasan, "Design analysis and modeling of a general aviation aircraft," Jordan Journal of Mechanical and Industrial Engineering, vol. 6, pp. 183-191, 2012. View at Google Scholar
  6. W. A. J. Anemaat, Conceptual airplane design systems. In encyclopaedia of aerospace engineering, R. Blockly, and W. Shyy (Eds). Chichester: John Wiley & Sons, 2010.
  7. The Official Website of the Beriev Aircraft Company, Retrieved from www.beriev.com. [Accessed 18 October 2016], 1996.
  8. The Official Website, Retrieved from http://www.airwar.ru. [Accessed 16 October 2016], 1998.
  9. I. B. Abbasov, Basics of three-dimensional modeling in the graphics system 3 ds Max 2009. Textbook. Moscow: DMK Press, 2009.
  10. V. V. Orekhov and I. B. Abbasov, "Computational modeling of amphibious Be-103," in Proceedings of the Southern Federal University. Technical Sciences, 2011, pp. 121-125.
  11. I. B. Abbasov and V. V. Orekhov, Amphibious computational modeling. – Saarbrucken. Germany: LAP Lambert Academic Publishing, 2012.
  12. I. B. Abbasov and V. V. Orekhov, "Computational modeling of multipurpose amphibious aircraft Be-200," Advances in Engineering Software, vol. 69, pp. 12-17, 2014. View at Google Scholar | View at Publisher
  13. S. M. Yeger, A. M. Matvienko, and I. A. Shatalov, Basics of aircraft: Textbook. M: Mashi-Nostroenie, 2003.
  14. D. P. Raymer, Living in the future; the education and adventures of an advanced aircraft de-signer. Los Angeles: Design Dimension Press, 2009.
No any video found for this article.
(2017). Computational Modeling of Multi-Purpose Amphibious Aircraft Be-103. Review of Computer Engineering Research, 4(1): 1-10. DOI: 10.18488/journal.76/2017.4.1/76.1.1.10
The paper is dedicated to the aspects of 3D computational modeling of Be-103 amphibious aircraft. The paper contains initial Figures and drawings; the computational modeling is performed in 3 ds Max 3D graphic modeling system. Models of amphibious aircraft structural components are produced by polygonal extrusion process. Shading is performed at the sub-objects level as well as assignment of materials. Figures illustrating realistic rendering of amphibious aircraft 3D-model are presented as well.
Contribution/ Originality
The main contribution of this article is to create a method of designing from the initial sketch-es to photorealistic model of amphibious aircraft. Polygonal modeling method has advantages in the designing of complex engineering objects. For high-quality rendering of the final model uses an improved calculating method of lighting.