Topological Simplification of Nested Shapes
| dc.contributor.author | Zeng, Dan | en_US |
| dc.contributor.author | Chambers, Erin | en_US |
| dc.contributor.author | Letscher, David | en_US |
| dc.contributor.author | Ju, Tao | en_US |
| dc.contributor.editor | Campen, Marcel | en_US |
| dc.contributor.editor | Spagnuolo, Michela | en_US |
| dc.date.accessioned | 2022-06-27T16:19:55Z | |
| dc.date.available | 2022-06-27T16:19:55Z | |
| dc.date.issued | 2022 | |
| dc.description.abstract | We present a method for removing unwanted topological features (e.g., islands, handles, cavities) from a sequence of shapes where each shape is nested in the next. Such sequences can be found in nature, such as a multi-layered material or a growing plant root. Existing topology simplification methods are designed for single shapes, and applying them independently to shapes in a sequence may lose the nesting property. We formulate the nesting-constrained simplification task as an optimal labelling problem on a set of candidate shape deletions (''cuts'') and additions (''fills''). We explored several optimization strategies, including a greedy heuristic that sequentially propagates labels, a state-space search algorithm that is provably optimal, and a beam-search variant with controllable complexity. Evaluation on synthetic and real-world data shows that our method is as effective as single-shape simplification methods in reducing topological complexity and minimizing geometric changes, and it additionally ensures nesting. Also, the beam-search strategy is found to strike the best balance between optimality and efficiency. | en_US |
| dc.description.number | 5 | |
| dc.description.sectionheaders | Tiling and Nesting | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 41 | |
| dc.identifier.doi | 10.1111/cgf.14611 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.pages | 161-173 | |
| dc.identifier.pages | 13 pages | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.14611 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf14611 | |
| dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.subject | CCS Concepts: Computing methodologies --> Shape analysis; Volumetric models | |
| dc.subject | Computing methodologies | |
| dc.subject | Shape analysis | |
| dc.subject | Volumetric models | |
| dc.title | Topological Simplification of Nested Shapes | en_US |
Files
Original bundle
1 - 1 of 1