We study some basic morphological operators acting on the lattice of all subgraphs of an arbitrary (unweighted) graph G. To this end, we consider two dual adjunctions between the …
A fast and exact algorithm to eliminate intersections from arbitrary triangle meshes is presented, without any strict requirement on the input. Differently from most recent …
J Cousty, L Najman, J Serra - … Morphology and its Applications to Signal …, 2009 - Springer
We study some basic morphological operators acting on the lattice of all subgraphs of a (non- weighted) graph G. To this end, we consider two dual adjunctions between the edge set and …
High-level spatial relation and configuration modeling issues are gaining momentum in the image analysis and pattern recognition fields. In particular, it is deemed important whenever …
Spatial clustering analysis is an important issue that has been widely studied to extract the meaningful subgroups of geo-referenced data. Although many approaches have been …
F Dias, J Cousty, L Najman - … Geometry for Computer Imagery: 16th IAPR …, 2011 - Springer
In this work, we propose a framework that allows to build morphological operators for processing and filtering objects defined on (abstract) simplicial complex spaces. We …
We present a programming framework for discrete mathematical morphology centered on the concept of genericity. We show that formal definitions of morphological algorithms can …
I Chalás, P Urbanová, V Juřík, Z Ferková… - The Visual …, 2017 - Springer
Generating large human crowds of distinguishable individuals is one of the challenges in the gaming industry. When the scene contains many characters, it becomes impracticable to …
V Lenders, J Wagner, M May - … on a World of Wireless, Mobile …, 2006 - ieeexplore.ieee.org
This paper analyzes the characteristics of a multi-hop 802.11 b mobile ad hoc network. We present data gathered from a mobile network of 20 devices carried by test users over 5 days …