Training Climbing Roses by Constrained Graph Search

IF 0.9 4区 计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Wataru Umezawa, Tomohiko Mukai
{"title":"Training Climbing Roses by Constrained Graph Search","authors":"Wataru Umezawa,&nbsp;Tomohiko Mukai","doi":"10.1002/cav.2297","DOIUrl":null,"url":null,"abstract":"<p>Cultivated climbing roses are skillfully shaped by arranging their stems manually against support walls to enhance their aesthetic appeal. This study introduces a procedural technique designed to replicate the branching pattern of climbing roses, simulating the manual training process. The central idea of the proposed approach is the conceptualization of tree modeling as a constrained path-finding problem. The primary goal is to optimize the stem structure to achieve the most impressive floral display. The proposed method operates iteratively, generating multiple stems while applying the objective function in each iteration for maximizing coverage on the support wall. Our approach offers a diverse range of tree forms employing only a few parameters, which eliminates the requirement for specialized knowledge in cultivation or plant ecology.</p>","PeriodicalId":50645,"journal":{"name":"Computer Animation and Virtual Worlds","volume":"35 6","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cav.2297","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Animation and Virtual Worlds","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cav.2297","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Cultivated climbing roses are skillfully shaped by arranging their stems manually against support walls to enhance their aesthetic appeal. This study introduces a procedural technique designed to replicate the branching pattern of climbing roses, simulating the manual training process. The central idea of the proposed approach is the conceptualization of tree modeling as a constrained path-finding problem. The primary goal is to optimize the stem structure to achieve the most impressive floral display. The proposed method operates iteratively, generating multiple stems while applying the objective function in each iteration for maximizing coverage on the support wall. Our approach offers a diverse range of tree forms employing only a few parameters, which eliminates the requirement for specialized knowledge in cultivation or plant ecology.

Abstract Image

通过受限图谱搜索训练攀爬玫瑰
栽培的攀援玫瑰通过人工将茎部排列在支撑墙上,巧妙地塑造出各种形状,以增强其美感。本研究介绍了一种程序技术,旨在复制攀援玫瑰的分枝模式,模拟人工训练过程。所提方法的核心思想是将树建模概念化为一个受限路径寻找问题。主要目标是优化茎干结构,以达到最令人印象深刻的花卉展示效果。所提出的方法采用迭代法,在生成多个茎的同时,在每次迭代中应用目标函数,以最大限度地覆盖支撑墙。我们的方法只需几个参数,就能提供多种树形,因此无需专业的栽培或植物生态学知识。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Animation and Virtual Worlds
Computer Animation and Virtual Worlds 工程技术-计算机:软件工程
CiteScore
2.20
自引率
0.00%
发文量
90
审稿时长
6-12 weeks
期刊介绍: With the advent of very powerful PCs and high-end graphics cards, there has been an incredible development in Virtual Worlds, real-time computer animation and simulation, games. But at the same time, new and cheaper Virtual Reality devices have appeared allowing an interaction with these real-time Virtual Worlds and even with real worlds through Augmented Reality. Three-dimensional characters, especially Virtual Humans are now of an exceptional quality, which allows to use them in the movie industry. But this is only a beginning, as with the development of Artificial Intelligence and Agent technology, these characters will become more and more autonomous and even intelligent. They will inhabit the Virtual Worlds in a Virtual Life together with animals and plants.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信