Efficient Data Structures for Computer Graphics and Image Processing
Author: Guillaume Damiand
Publisher: CRC Press
A Versatile Framework for Handling Subdivided Geometric Objects Combinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing gathers important ideas related to combinatorial maps and explains how the maps are applied in geometric modeling and image processing. It focuses on two subclasses of combinatorial maps: n-Gmaps and n-maps. Suitable for researchers and graduate students in geometric modeling, computational and discrete geometry, computer graphics, and image processing and analysis, the book presents the data structures, operations, and algorithms that are useful in handling subdivided geometric objects. It shows how to study data structures for the explicit representation of subdivided geometric objects and describes operations for handling the structures. The book also illustrates results of the design of data structures and operations.
This book constitutes the refereed proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011, held in Palermi, Italy, in June 2011. The 36 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 70 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problems or pinpoint conditions under which searches cannot be performed efficiently. The meeting also deals with problems in computational biology, data compression and data mining, coding, information retrieval, natural language processing and pattern recognition.
12th International Workshop, IWCIA 2008, Buffalo, NY, USA, April 7-9, 2008, Proceedings
Author: Valentin E. Brimkov
This volume contains the proceedings of the 12th International Workshop on Combinatorial Image Analysis. Coverage includes digital geometry, curves and surfaces, applications of computational geometry, as well as medical imaging and biometrics.
This book constitutes the refereed proceedings at PAKDD Workshops 2014, held in conjunction with the 18th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD) held in Tainan, Taiwan, in May 2014. The 73 revised papers presented were carefully reviewed and selected from 179 submissions. The workshops affiliated with PAKDD 2014 include: Data Analytics for Targeted Healthcare, DANTH; Data Mining and Decision Analytics for Public Health and Wellness, DMDA-Health; Biologically Inspired Data Mining Techniques, BDM; Mobile Data Management, Mining, and Computing on Social Networks, MobiSocial; Big Data Science and Engineering on E-Commerce, BigEC; Cloud Service Discovery, CloudSD; Mobile Sensing, Mining and Visualization for Human Behavior Inferences, MSMV-HBI; Scalable Dats Analytics: Theory and Algorithms, SDA; Algorithms for Large-Scale Information Processing in Knowledge Discovery, ALSIP; Data Mining in Social Networks, SocNet; Data Mining in Biomedical Informatics and Healthcare, DMBIH; and Pattern Mining and Application of Big Data, BigPMA.
7th IAPR-TC-15 International Workshop, GbRPR 2009, Venice, Italy, May 26-28, 2009. Proceedings
Author: Andrea Torsello
Publisher: Springer Science & Business Media
This book constitutes the refereed proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition, GbRPR 2009, held in Venice, Italy in May 2009. The 37 revised full papers presented were carefully reviewed and selected from 47 submissions. The papers are organized in topical sections on graph-based representation and recognition, graph matching, graph clustering and classification, pyramids, combinatorial maps, and homologies, as well as graph-based segmentation.
Higher Dimensional Combinatorial Maps and Quantum Gravity
Author: Luca Lionni
Category: Combinatorial analysis
This book provides a number of combinatorial tools that allow a systematic study of very general discrete spaces involved in the context of discrete quantum gravity. In any dimension D, we can discretize Euclidean gravity in the absence of matter over random discrete spaces obtained by gluing families of polytopes together in all possible ways. These spaces are then classified according to their curvature. In D=2, it results in a theory of random discrete spheres, which converge in the continuum limit towards the Brownian sphere, a random fractal space interpreted as a quantum random space-time. In this limit, the continuous Liouville theory of D=2 quantum gravity is recovered. Previous results in higher dimension regarded triangulations, converging towards a continuum random tree, or gluings of simple building blocks of small sizes, for which multi-trace matrix model results are recovered in any even dimension. In this book, the author develops a bijection with stacked two-dimensional discrete surfaces for the most general colored building blocks, and details how it can be used to classify colored discrete spaces according to their curvature. The way in which this combinatorial problem arrises in discrete quantum gravity and random tensor models is discussed in detail.
4th IAPR International Workshop, GbRPR 2003, York, UK, June 30 - July 2, 2003. Proceedings
Author: Edwin Hancock
Publisher: Springer Science & Business Media
This volume contains the papers presented at the Fourth IAPR Workshop on Graph Based Representations in Pattern Recognition. The workshop was held at the King’s Manor in York, England between 30 June and 2nd July 2003. The previous workshops in the series were held in Lyon, France (1997), Haindorf, Austria (1999), and Ischia, Italy (2001). The city of York provided an interesting venue for the meeting. It has been said that the history of York is the history of England. There have been both Roman and Viking episodes. For instance, Constantine was proclaimed emperor in York. The city has also been a major seat of ecclesiastical power and was also involved in the development of the railways in the nineteenth century. Much of York’s history is evidenced by its buildings, and the King’s Manor is one of the most important and attractive of these. Originally part of the Abbey, after the dissolution of the monasteries by Henry VIII, the building became a center of government for the Tudors and the Stuarts (who stayed here regularly on their journeys between London and Edinburgh), serving as the headquarters of the Council of the North until it was disbanded in 1561. The building became part of the University of York at its foundation in 1963. The papers in the workshop span the topics of representation, segmentation, graph-matching, graph edit-distance, matrix and spectral methods, and gra- clustering.
A combinatorial map is a connected topological graph cellularly embedded in a surface. This monograph concentrates on the automorphism group of a map, which is related to the automorphism groups of a Klein surface and a Smarandache manifold, also applied to the enumeration of unrooted maps on orientable and non-orientable surfaces. A number of results for the automorphism groups of maps, Klein surfaces and Smarandache manifolds and the enumeration of unrooted maps underlying a graph on orientable and non-orientable surfaces are discovered. An elementary classification for the closed s-manifolds is found. Open problems related to the combinatorial maps with the differential geometry, Riemann geometry and Smarandache geometries are also presented in this monograph for the further applications of the combinatorial maps to the classical mathematics.
Excellent text covers vector fields, plane homology and the Jordan Curve Theorem, surfaces, homology of complexes, more. Problems and exercises. Some knowledge of differential equations and multivariate calculus required.Bibliography. 1979 edition.