Discrete Geometry for Computer Imagery
From MaRDI portal
Publication:5902441
DOI10.1007/b94107zbMath1254.68237OpenAlexW2913003025MaRDI QIDQ5902441
Giuseppe Patanè, Michela Mortara, Bianca Falcidieno, Michela Spagnuolo, Simone Marini, Silvia Biasotti
Publication date: 5 January 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b94107
Pattern recognition, speech recognition (68T10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (6)
Graph characterization by counting sink star subgraphs ⋮ GRAPH MATCHING A SKELETONIZED THEORETICAL MORPHOSPACE WITH A CLADOGRAM FOR GOMPHONEMOID-CYMBELLOID DIATOMS (BACILLARIOPHYTA) ⋮ Fast depth-based subgraph kernels for unattributed graphs ⋮ 3D shape retrieval using kernels on extended Reeb graphs ⋮ Size functions for comparing 3D models ⋮ Reeb graphs for shape analysis and applications
This page was built for publication: Discrete Geometry for Computer Imagery