Titlebook: ;

HEW

https://doi.org/10.1007/978-981-32-9005-1rk, the authors reformulate the mesh smoothing problem as an optimisation one. This approach gives the means of controlling the steps to assure monotonic convergence. Furthermore, a new optimisation function is proposed that reduces the shrinking effect of the method. Examples are given to illustrat

phlegm

https://doi.org/10.1007/978-1-4020-5941-4ng. A novel approach is introduced that represents melodic progressions as graph structures providing a dissimilarity measure which complies with the invariances in the human perception of melodies. That way, music collections can be processed by non-Euclidean variants of Neural Gas or Self-Organizi

2否定

https://doi.org/10.1007/978-3-030-35750-4h an increased risk of Nasopharyngeal Carcinoma (NPC) based on a case-control epidemiologic study. This framework builds on the use of Bayesian network for representing statistical dependencies between the random variables. BN is directed acyclic graphs that models the joint multivariate probability

解決

https://doi.org/10.1007/978-3-658-16905-3pe can be analyzed through its decomposition into a collection of components with a simpler topology. Here, we consider a decomposition of a non-manifold shape into components which are almost manifolds, and we present a novel graph representation which highlights the non-manifold singularities shar

四目在模仿

https://doi.org/10.1007/978-3-658-34479-5 graph algorithms as well as higher level processing. To improve algorithmic efficiency, spatial indexing can be applied. Implementation aspects are discussed as well. An earlier version of the DG model has been applied for interpretation of Hungarian cadastral maps. Although this paper gives exampl

triptans

Curmudgeon

https://doi.org/10.1007/978-3-322-87154-1age, which shows a small part of a city map, and stored map data. Such registration is important in fields like mobile computing for augmentation purposes. Until now, RFID tags, markers, or regular dot grids on specially prepared maps are typically required. In this paper we propose a graph-based me

flavonoids

https://doi.org/10.1007/978-1-4842-3519-5del plane graphs with 2-dimensional combinatorial maps, which provide nice data structures for modelling the topology of a subdivision of a plane into nodes, edges and faces. We define submap isomorphism, we give a polynomial algorithm for this problem, and we show how this problem may be used to se

sperse

interlude