Abstract
In this chapter, a method to synthesize the abstract shapes is developed. This method is characterized by operating the abstract shapes on the space in which the abstract shapes are represented, by using the evaluation function from which the shape can be deduced using the optimization method. This method is composed of three steps. First, the evaluation function is acquired by using Genetic Algorithms (GA) and Genetic Programming (GP). Second, the acquired evaluation functions are combined. Third, a new abstract shape is created by using GA. In the experiment, the images of “chair” and “pyramid” are synthesized.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Goldberg DE (2001) Genetic algorithms in search, optimization, and machine learning. Addison Wesley Longman Publishing Company, Boston
Koza JR (1993) Genetic programming: on the programming of computers by means of natural selection. The MIT Press, Cambridge
Nishita T, Nakamae E (1994) A method for displaying metaballs by using Bezier clipping. Comput Graph Forum 13:271–280. doi:10.1111/1467-8659.1330271
Taura T, Shiose S, Ishida R (2002) Strategic shape design. In: Proceedings of the 7th international conference on artificial intelligence in design. Cambridge, UK, 13–17 July, pp 371–382
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this chapter
Cite this chapter
Taura, T., Nagai, Y. (2013). Synthesis of Abstract Shape: Practice of Concept Generation (1). In: Concept Generation for Design Creativity. Springer, London. https://doi.org/10.1007/978-1-4471-4081-8_9
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4081-8_9
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4080-1
Online ISBN: 978-1-4471-4081-8
eBook Packages: EngineeringEngineering (R0)