dc.contributor.author | Dabbaghchian, Saeed | en_US |
dc.contributor.editor | Jain, Eakta and Kosinka, Jirí | en_US |
dc.date.accessioned | 2018-04-14T18:29:56Z | |
dc.date.available | 2018-04-14T18:29:56Z | |
dc.date.issued | 2018 | |
dc.identifier.issn | 1017-4656 | |
dc.identifier.uri | http://dx.doi.org/10.2312/egp.20181018 | |
dc.identifier.uri | https://diglib.eg.org:443/handle/10.2312/egp20181018 | |
dc.description.abstract | Detecting the boundaries of an enclosed region is a problem which arises in some applications such as the human upper airway modeling. Using of standard algorithms fails because of the inevitable errors, i.e. gaps and overlaps between the surrounding boundaries. Growing circles is an automatic approach to address this problem. A circle is centered inside the region and starts to grow by increasing its radius. Its growth is limited either by the surrounding boundaries or by reaching its maximum radius. To deal with complex shapes, many circles are used in which each circle partially reconstructs the region, and the whole region is determined by the union of these partial regions. The center of the circles and their maximum radius are calculated adaptively. It is similar to the region growing algorithm which is widely used in image processing applications. However, it works for unstructured grids as well as Cartesian ones. As an application of the method, it is applied to detect the boundaries of the upper airway cross-sections. | en_US |
dc.publisher | The Eurographics Association | en_US |
dc.subject | Computing methodologies | |
dc.subject | Shape modeling | |
dc.subject | Reconstruction | |
dc.subject | Applied computing | |
dc.subject | Physics | |
dc.title | Growing Circles: A Region Growing Algorithm for Unstructured Grids and Non-aligned Boundaries | en_US |
dc.description.seriesinformation | EG 2018 - Posters | |
dc.description.sectionheaders | Posters | |
dc.identifier.doi | 10.2312/egp.20181018 | |
dc.identifier.pages | 21-22 | |