This article aims to establish the relationship between philosopher Maurice Merleau-Ponty and artist Robert Delaunay regarding corporeality visibility of work art. These notions are developed by in his text The eye spirit together with theory inobjective art Delaunay, expressed From cubism . Moreover, explicitly refers this text, so it is possible outline a correspondence both, especially, thei...

We describe a robust but simple algorithm to reconstruct a surface from a set of merged range scans. Our key contribution is the formulation of the surface reconstruction problem as an energy minimisation problem that explicitly models the scanning process. The adaptivity of the Delaunay triangulation is exploited by restricting the energy to inside/outside labelings of Delaunay tetrahedra. Our...

Background. The common purpose of modelling and using minimum spanning trees is to ensure efficient coverage. In many tasks designing telecommunication networks, the number network nodes usually limited. terms rational allocation, there are more possible locations than factually active tools be settled those locations.
 Objective. Given an initial set planar nodes, problem build a tree con...

Computational complexity is studied for the problem of stabbing set of straight line segments with the smallest cardinality set of disks of fixed radii r > 0 where the set of segments forms straight line drawing of planar graph. This problem along with its relatives [3] arise in physical network security analysis for telecommunication, wireless and road networks represented by geometric graphs ...

Building generalization is a difficult operation due to the complexity of the spatial distribution of buildings and for reasons of spatial recognition. In this study, building generalization is decomposed into two steps, i.e. building grouping and generalization execution. The neighbourhood model in urban morphology provides global constraints for guiding the global partitioning of building set...

We continue 3], the study of the lattice L n generated by cuts of the complete graph on a set V n of n vertices. The lattice L n spans an N = ? n 2-dimensional space of all functions deened on a set V 2 n of all unordered pairs of the set V n. We prove that the cut polytope, i.e. the convex hull of all cuts, is an asymmetric Delaunay polytope of L n. Symmetric Delaunay polytopes of a lattice L ...

When we have two data sets and want to find the nearest neighbour of each point in the first dataset among points in the second one, we need the all nearest neighbour operator. This is an operator in spatial databases that has many application in different fields such as GIS and VLSI circuit design. Existing algorithms for calculating this operator assume that there is no pre computation on the...

In this paper, we propose a new multi-layer structural approach for the task of object based image retrieval. In our work we tackle the problem of structural organization of local features. The structural features we propose are nested multi-layered local graphs built upon sets of SURF feature points with Delaunay triangulation. A Bag-of-Visual-Words (BoVW) framework is applied on these graphs,...

In this paper, we propose a new, scalable approach for the task of object based image search or object recognition. Despite the very large literature existing on the scalability issues in CBIR in the sense of retrieval approaches, the scalability of media and scalability of features remain an issue. In our work we tackle the problem of scalability and structural organization of features. The pr...