Matches in SemOpenAlex for { <https://semopenalex.org/work/W2224964986> ?p ?o ?g. }
Showing items 1 to 65 of
65
with 100 items per page.
- W2224964986 abstract "When a disk in 2D is stretched arbitrarily with possible self-overlaps, the boundary of the disk forms a complex self-intersecting closed loop curve, known as a self-overlapping curve. Examples of such curves can be found in animation applications, molecular structures of certain allotropes of carbon, like graphite, and many other physical models. Given a self-overlapping curve, a novel method to compute the deformation pattern (immersion) of the disk is proposed in this work, which is useful in applications like animation and compression.The process of forming a disk immersion implies a natural morphing sequence. The second part of this work computes a smooth morphing between two self-overlapping curves. This is achieved by computing a compatible triangulation of the curve interiors using the earlier mentioned method of computing disk immersions, and then morphing each individual triangle from the source to target. The method automatically computes smooth morphs given the source and target shapes, wherein each intermediate morphed shape is a self-overlapping curve.While morphing compatible triangulations of two self-overlapping curves produces satisfactory morphs in most cases, an even better morph is obtained by morphing the skeletons of both the curves. Since the triangulation of a disk, and hence the interior of a self-overlapping curve, is a tree, the medial axis or skeleton of a self-overlapping curve is a geometric tree. Morphing geometric trees requires the establishment of a good match between their node sets. In this context, two different geometric tree matching algorithms are proposed. The first one is generic in nature and computes matches between two arbitrary geometric trees by modeling the problem as minimum weight bipartite graph matching problem. Such trees may be found as representatives of actual physical systems like river bed patterns, respiratory trees of mammals etc. These trees may undergo structural changes with time or under the influence of external agents and a match between different instances of such trees helps to infer the change.A second method for matching geometric trees, based on dynamic programming, is also proposed which is more suited to morphing applications, which prohibits cross-over of tree branches while morphing. The matches obtained from this second method are used to design a novel geometric tree morphing algorithm which is based on motion planning concepts. The morph is symmetric in nature and minimizes the distance travelled by the tree branches while morphing." @default.
- W2224964986 created "2016-06-24" @default.
- W2224964986 creator A5042196702 @default.
- W2224964986 creator A5064642864 @default.
- W2224964986 date "2013-01-01" @default.
- W2224964986 modified "2023-09-27" @default.
- W2224964986 title "Geometric tree matching and morphing and its application to morphing of self-overlapping curves" @default.
- W2224964986 hasPublicationYear "2013" @default.
- W2224964986 type Work @default.
- W2224964986 sameAs 2224964986 @default.
- W2224964986 citedByCount "0" @default.
- W2224964986 crossrefType "journal-article" @default.
- W2224964986 hasAuthorship W2224964986A5042196702 @default.
- W2224964986 hasAuthorship W2224964986A5064642864 @default.
- W2224964986 hasConcept C121684516 @default.
- W2224964986 hasConcept C134306372 @default.
- W2224964986 hasConcept C135981907 @default.
- W2224964986 hasConcept C151730666 @default.
- W2224964986 hasConcept C185877587 @default.
- W2224964986 hasConcept C2524010 @default.
- W2224964986 hasConcept C2779343474 @default.
- W2224964986 hasConcept C33923547 @default.
- W2224964986 hasConcept C41008148 @default.
- W2224964986 hasConcept C50637493 @default.
- W2224964986 hasConcept C62354387 @default.
- W2224964986 hasConcept C86803240 @default.
- W2224964986 hasConceptScore W2224964986C121684516 @default.
- W2224964986 hasConceptScore W2224964986C134306372 @default.
- W2224964986 hasConceptScore W2224964986C135981907 @default.
- W2224964986 hasConceptScore W2224964986C151730666 @default.
- W2224964986 hasConceptScore W2224964986C185877587 @default.
- W2224964986 hasConceptScore W2224964986C2524010 @default.
- W2224964986 hasConceptScore W2224964986C2779343474 @default.
- W2224964986 hasConceptScore W2224964986C33923547 @default.
- W2224964986 hasConceptScore W2224964986C41008148 @default.
- W2224964986 hasConceptScore W2224964986C50637493 @default.
- W2224964986 hasConceptScore W2224964986C62354387 @default.
- W2224964986 hasConceptScore W2224964986C86803240 @default.
- W2224964986 hasLocation W22249649861 @default.
- W2224964986 hasOpenAccess W2224964986 @default.
- W2224964986 hasPrimaryLocation W22249649861 @default.
- W2224964986 hasRelatedWork W126836929 @default.
- W2224964986 hasRelatedWork W1538436283 @default.
- W2224964986 hasRelatedWork W1579517233 @default.
- W2224964986 hasRelatedWork W2030097401 @default.
- W2224964986 hasRelatedWork W2117138743 @default.
- W2224964986 hasRelatedWork W2197164909 @default.
- W2224964986 hasRelatedWork W2242055305 @default.
- W2224964986 hasRelatedWork W248219399 @default.
- W2224964986 hasRelatedWork W2517665947 @default.
- W2224964986 hasRelatedWork W2728183739 @default.
- W2224964986 hasRelatedWork W2768974198 @default.
- W2224964986 hasRelatedWork W2888384911 @default.
- W2224964986 hasRelatedWork W2990785919 @default.
- W2224964986 hasRelatedWork W3044872212 @default.
- W2224964986 hasRelatedWork W3080385371 @default.
- W2224964986 hasRelatedWork W3205038521 @default.
- W2224964986 hasRelatedWork W4599349 @default.
- W2224964986 hasRelatedWork W51472912 @default.
- W2224964986 hasRelatedWork W576445990 @default.
- W2224964986 hasRelatedWork W603957642 @default.
- W2224964986 isParatext "false" @default.
- W2224964986 isRetracted "false" @default.
- W2224964986 magId "2224964986" @default.
- W2224964986 workType "article" @default.