Efficient Data Structures for Computer Graphics and Image Processing
Author: Guillaume Damiand,Pascal Lienhardt
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.
Higher Dimensional Combinatorial Maps and Quantum Gravity
Author: Luca Lionni
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.
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.
Valentin E. Brimkov,Reneta P. Barneva,Herbert A. Hauptman
12th International Workshop, IWCIA 2008, Buffalo, NY, USA, April 7-9, 2008, Proceedings
Author: Valentin E. Brimkov,Reneta P. Barneva,Herbert A. Hauptman
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.
Wen-Chih Peng,Haixun Wang,James Bailey,Vincent S. Tseng,Tu-Bao Ho,Zhi-Hua Zhou,Arbee L.P. Chen
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.
In recent years, motivated by Shrkovskii's theorem, researchers have realized that a good deal of information about the dynamics of a map on the interval can be deduced from the combinatorial structure of its periodic orbits. This data can be formulated as a forcing relation between cyclic permutations (representing orbit types of periodic orbits). The present study investigates a number of new features of this relation and its generalization to multicyclic permutations (modelling finite unions of periodic orbits) and combinatorial patterns (modelling finite invariant sets). A central theme is the role of reductions and extensions of permutations. Results include: (i) a combinatorial shadowing theorem and its application to approximating permutations by cycles in the forcing relation; (ii) the distribution of different representatives of a given cycle in one (adjusted) map; (iii) characterization of the forcing-maximal permutations and patterns of fixed degree; and (iv) a calculation of the asymptotic growth rate of the maximum entropy forced by a permutation of given degree.
Edwin Hancock,Mario Vento,International Association for Pattern Recognition
4th IAPR International Workshop, GbRPR 2003, York, UK, June 30 - July 2, 2003. Proceedings
Author: Edwin Hancock,Mario Vento,International Association for Pattern Recognition
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.
Francesc J. Ferri,Jose M. Inesta,Adnan Amin,Pavel Pudil
Joint IAPR International Workshops SSPR 2000 and SPR 2000 Alicante, Spain, August 30 - September 1, 2000 Proceedings
Author: Francesc J. Ferri,Jose M. Inesta,Adnan Amin,Pavel Pudil
Publisher: Springer Science & Business Media
This book constitutes the joint refereed proceedings of the 8th International Workshop on Structural and Syntactic Pattern Recognition and the 3rd International Workshop on Statistical Techniques in Pattern Recognition, SSPR 2000 and SPR 2000, held in Alicante, Spain in August/September 2000. The 52 revised full papers presented together with five invited papers and 35 posters were carefully reviewed and selected from a total of 130 submissions. The book offers topical sections on hybrid and combined methods, document image analysis, grammar and language methods, structural matching, graph-based methods, shape analysis, clustering and density estimation, object recognition, general methodology, and feature extraction and selection.
5th IAPR International Workshop, GbRPR 2005, Poitiers, France, April 11-13, 2005, Proceedings
Author: Luc Brun,Mario Vento
Publisher: Springer Science & Business Media
This book constitutes the refereed proceedings of the 5th IAPR International Workshop on Graph-Based Representations in Pattern Recognition, GbRPR 2005, held in Poitiers, France in April 2005. The 18 revised full papers and 17 revised poster papers presented were carefully reviewed and selected from 50 submissions. The papers are organized in topical sections on graph representations, graphs and linear representations, combinatorial maps, matching, hierarchical graph abstraction and matching, inexact
This book constitutes the refereed proceedings of the 10th International Conference on Digital Geometry for Computer Imagery, DGCI 2002, held in Bordeaux, France, in April 2002. The 22 revised full papers and 13 posters presented together with 3 invited papers were carefully reviewed and selected from 67 submissions. The papers are organized in topical sections on topology, combinatorial image analysis, morphological analysis, shape representation, models for discrete geometry, segmentation and shape recognition, and applications.
In 1890 P. J. Heawood  published a formula which he called the Map Colour Theorem. But he forgot to prove it. Therefore the world of mathematicians called it the Heawood Conjecture. In 1968 the formula was proven and therefore again called the Map Color Theorem. (This book is written in California, thus in American English. ) Beautiful combinatorial methods were developed in order to prove the formula. The proof is divided into twelve cases. In 1966 there were three of them still unsolved. In the academic year 1967/68 J. W. T. Youngs on those three cases at Santa Cruz. Sur invited me to work with him prisingly our joint effort led to the solution of all three cases. It was a year of hard work but great pleasure. Working together was extremely profitable and enjoyable. In spite of the fact that we saw each other every day, Ted wrote a letter to me, which I present here in shortened form: Santa Cruz, March 1, 1968 Dear Gerhard: Last night while I was checking our results on Cases 2, 8 and 11, and thinking of the great pleasure we had in the afternoon with the extra ordinarily elegant new solution for Case 11, it seemed to me appropriate to pause for a few minutes and dictate a historical memorandum. We began working on Case 8 on 10 October 1967, and it was settled on Tuesday night, 14 November 1967.
Geometric Etudes in Combinatorial Mathematics is not only educational, it is inspirational. This distinguished mathematician captivates the young readers, propelling them to search for solutions of life’s problems—problems that previously seemed hopeless.The book provides supplementary reading materials to students at various levels interested in pursuing mathematics, especially in algebra, geometry, or combinatorial geometry.
Walter G. Kropatsch,Nicole M. Artner,Yll Haxhimusa,Xiaoyi Jiang
9th IAPR-TC-15 International Workshop, GbRPR 2013, Vienna, Austria, May 15-17, 2013, Proceedings
Author: Walter G. Kropatsch,Nicole M. Artner,Yll Haxhimusa,Xiaoyi Jiang
This book constitutes the refereed proceedings of the 9th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition, GbRPR 2013, held in Vienna, Austria, in May 2013. The 24 papers presented in this volume were carefully reviewed and selected from 27 submissions. They are organized in topical sections named: finding subregions in graphs; graph matching; classification; graph kernels; properties of graphs; topology; graph representations, segmentation and shape; and search in graphs.
This volume contains the contributions presented at the International Workshop on Current Trends in Applied Formal Methods organized October 7-9, 1998, in Boppard, Germany. The main objective of the workshop was to draw a map of the key issues facing the practical application of formal methods in industry. This appears to be particularly timely with safety and security issues becoming a real obstacle to industrial software and hardware development. As a consequence, almost all major companies have now set up departments or groups to work with formal methods and many European countries face a severe labour shortage in this new field. Tony Hoare's prediction of the art of software (and hardware) development becoming a proper engineering science with its own body of tools and techniques is now becoming a reality. So the focus of this application oriented workshop was not so much on spe cial academic topics but rather on the many practical aspects of this emerging new technology: verification and validation, and tool support and integration into the software life-cycle. By evaluating the state of the art with respect to industrial applications a discussion emerged among scientists, practising engi neers, and members of regulatory and funding agencies about future needs and developments. This discussion lead to roadmaps with respect to the future of this field, to tool support, and potential application areas and promising market segments. The contributions of the participants from industry as well as from the respective national security bureaus were particularly valuable and highly appreciated.
The action of a compact Lie group, G, on a compact sympletic manifold gives rise to some remarkable combinatorial invariants. The simplest and most interesting of these is the moment polytopes, a convex polyhedron which sits inside the dual of the Lie algebra of G. One of the main goals of this monograph is to describe what kinds of geometric information are encoded in this polytope. This book is addressed to researchers and can be used as a semester text.