Related papers: Around distance-squared mappings
This is a survey paper. We study the Ricci curvature and spectrum of graphs, as well as the exterior forms and deRahm cohomology on graphs.
Survey talk on certain aspects of the subject, stressing the neighbor relation as a basic notion in differential geometry.
In this expository article, we survey the rapidly emerging area of random geometric simplicial complexes.
Author developed a uniform model for different spaces where distance and angle measure kinds are parameters. This model is calculus centric, but can also be used in theoretical research. It is useful in the following domains: deduction of…
This is a survey of recent developments in the area of transport inequalities. We investigate their consequences in terms of concentration and deviation inequalities and sketch their links with other functional inequalities and also large…
We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.
Our goal is to provide a survey of some topics in quasiconformal analysis of current interest. We try to emphasize ideas and leave proofs and technicalities aside. Several easily stated open problems are given. Most of the results are joint…
In this survey we overview known results on the strong subgraph $k$-connectivity and strong subgraph $k$-arc-connectivity of digraphs. After an introductory section, the paper is divided into four sections: basic results, algorithms and…
We provide an elementary derivation of an orthogonal coordinate system for boundary layers around evolving smooth surfaces and curves based on the signed-distance function. We go beyond previous works on the signed-distance function and…
The paper concerns clustering with respect to the shape and size of 2D contours that are boundaries of cross-sections of 3D objects of revolution. We propose a number of similarity measures based on combined disparate Procrustes analysis…
This report presents a new, algorithmic approach to the distributions of the distance between two points distributed uniformly at random in various polygons, based on the extended Kinematic Measure (KM) from integral geometry. We first…
This paper is devoted to the study of strongly quasinonexpansive mappings in an abstract space and a Banach space.
We survey theoretical, algorithmic, and computational results at the intersection of distance geometry problems and mathematical programming, both with and without adjacencies as part of the input. While mathematical programming methods can…
In this paper we tackle the issue of clustering trajectories of geolocalized observations. Using clustering technics based on the choice of a distance between the observations, we first provide a comprehensive review of the different…
This is a brief and gentle introduction, aimed at graduate students, to the subject of model subspaces of the Hardy space.
We study the geometry of spaces of planes on smooth complete intersections of three quadrics, with a view toward rationality questions.
We provide a concise and accessible introduction to (geometric) string structures, highlighting their connection to loop spaces and outlining relationships with neighboring topics.
The order in which plane-filling curves visit points in the plane can be exploited to design efficient algorithms. Typically, the curves are useful because they preserve locality: points that are close to each other along the curve tend to…
Proximity maps and regions are defined based on the relative allocation of points from two or more classes in an area of interest and are used to construct random graphs called proximity catch digraphs (PCDs) which have applications in…
Numerical computation of shortest paths or geodesics on curved domains, as well as the associated geodesic distance, arises in a broad range of applications across digital geometry processing, scientific computing, computer graphics, and…