{"title":"Plani Plant动画框架","authors":"Tina L. M. Derzaph, Howard J. Hamilton","doi":"10.5121/IJCGA.2017.7201","DOIUrl":null,"url":null,"abstract":"The PLant ANImation (PLANI) framework allows a designer’s ideas and decisions about virtual plants to be guided through a structured process that results in an animation of a plant. The process proceeds by selecting relevant objects with properties from four logically grouped domains to simplify implementation. The resulting grouped objects are used as the baseline parameters for the coding process to create the virtual plant. PLANI’s construction is based on more than a thousand years of biological research, fifty years of functional-structural plant modelling, and ten years of ontology development, instantiated into an animation environment. PLANI ensures that, when designing virtual plants, a selection of objects derived from an appropriate ontology are considered, and that this selection depends on the purpose of the animation, e.g., whether it is for gaming animation, biological simulation, or film animation. The use of PLANI provides the developer with a framework that is flexible, covers a wide variety of structural, functional, and animation objects for plants, and provides classification of current computer algorithms by their applications to designing virtual plants.","PeriodicalId":54969,"journal":{"name":"International Journal of Computational Geometry & Applications","volume":"7 1","pages":"1-20"},"PeriodicalIF":0.0000,"publicationDate":"2017-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.5121/IJCGA.2017.7201","citationCount":"0","resultStr":"{\"title\":\"The Plani Plant Animation Framework\",\"authors\":\"Tina L. M. Derzaph, Howard J. Hamilton\",\"doi\":\"10.5121/IJCGA.2017.7201\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The PLant ANImation (PLANI) framework allows a designer’s ideas and decisions about virtual plants to be guided through a structured process that results in an animation of a plant. The process proceeds by selecting relevant objects with properties from four logically grouped domains to simplify implementation. The resulting grouped objects are used as the baseline parameters for the coding process to create the virtual plant. PLANI’s construction is based on more than a thousand years of biological research, fifty years of functional-structural plant modelling, and ten years of ontology development, instantiated into an animation environment. PLANI ensures that, when designing virtual plants, a selection of objects derived from an appropriate ontology are considered, and that this selection depends on the purpose of the animation, e.g., whether it is for gaming animation, biological simulation, or film animation. The use of PLANI provides the developer with a framework that is flexible, covers a wide variety of structural, functional, and animation objects for plants, and provides classification of current computer algorithms by their applications to designing virtual plants.\",\"PeriodicalId\":54969,\"journal\":{\"name\":\"International Journal of Computational Geometry & Applications\",\"volume\":\"7 1\",\"pages\":\"1-20\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-04-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.5121/IJCGA.2017.7201\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computational Geometry & Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5121/IJCGA.2017.7201\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computational Geometry & Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5121/IJCGA.2017.7201","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
The PLant ANImation (PLANI) framework allows a designer’s ideas and decisions about virtual plants to be guided through a structured process that results in an animation of a plant. The process proceeds by selecting relevant objects with properties from four logically grouped domains to simplify implementation. The resulting grouped objects are used as the baseline parameters for the coding process to create the virtual plant. PLANI’s construction is based on more than a thousand years of biological research, fifty years of functional-structural plant modelling, and ten years of ontology development, instantiated into an animation environment. PLANI ensures that, when designing virtual plants, a selection of objects derived from an appropriate ontology are considered, and that this selection depends on the purpose of the animation, e.g., whether it is for gaming animation, biological simulation, or film animation. The use of PLANI provides the developer with a framework that is flexible, covers a wide variety of structural, functional, and animation objects for plants, and provides classification of current computer algorithms by their applications to designing virtual plants.
期刊介绍:
The International Journal of Computational Geometry & Applications (IJCGA) is a quarterly journal devoted to the field of computational geometry within the framework of design and analysis of algorithms.
Emphasis is placed on the computational aspects of geometric problems that arise in various fields of science and engineering including computer-aided geometry design (CAGD), computer graphics, constructive solid geometry (CSG), operations research, pattern recognition, robotics, solid modelling, VLSI routing/layout, and others. Research contributions ranging from theoretical results in algorithm design — sequential or parallel, probabilistic or randomized algorithms — to applications in the above-mentioned areas are welcome. Research findings or experiences in the implementations of geometric algorithms, such as numerical stability, and papers with a geometric flavour related to algorithms or the application areas of computational geometry are also welcome.