Related papers: Efficient geodesics in the curve complex and their…
The Morse-Smale complex is a standard tool in visual data analysis. The classic definition is based on a continuous view of the gradient of a scalar function where its zeros are the critical points. These points are connected via gradient…
Topological correctness plays a critical role in many image segmentation tasks, yet most networks are trained using pixel-wise loss functions, such as Dice, neglecting topological accuracy. Existing topology-aware methods often lack robust…
A (fully) dynamic graph algorithm is a data structure that supports edge insertions, edge deletions, and answers specific queries pertinent to the problem at hand. In this work, we address the fully dynamic edge orientation problem, also…
Active contour models based on partial differential equations have proved successful in image segmentation, yet the study of their geometric formulation on arbitrary geometric graphs is still at an early stage. In this paper, we introduce…
Simultaneous Geometric Embedding (SGE) asks whether, for a given collection of graphs on the same vertex set V, there is an embedding of V in the plane that admits a crossing-free drawing with straightline edges for each of the given…
The length of the geodesic between two data points along a Riemannian manifold, induced by a deep generative model, yields a principled measure of similarity. Current approaches are limited to low-dimensional latent spaces, due to the…
Monadically stable and monadically NIP classes of structures were initially studied in the context of model theory and defined in logical terms. They have recently attracted attention in the area of structural graph theory, as they…
This article presents a new way to classify geodesics on a cone in the Euclidean 3-space. This proof is obtained considering our main result, which establishes the necessary and sufficient conditions that a curve in space must satisfy: to…
For a compact surface $S$ with constant negative curvature $-\kappa$ (for some $\kappa>0$) and genus $g\geq2$, we show that the tails of the distribution of $i(\alpha,\beta)/l(\alpha)l(\beta)$ (where $i(\alpha,\beta)$ is the intersection…
The existing combinatorial methods for iso-surface computation are efficient for pure visualization purposes, but it is known that the resulting iso-surfaces can have holes, and topological problems like missing or wrong connectivity can…
We introduce a spatial graph and hypergraph model that smoothly interpolates between a graph with purely pairwise edges and a graph where all connections are in large hyperedges. The key component is a spatial clustering resolution…
Let $\mathscr{P}_{m}$ be the graph on the set of perfect matchings in the complete graph $K_{2m}$, where two perfect matchings are connected by an edge if their symmetric difference is a cycle of length four. This paper studies geodesics in…
We show that on any translation surface, if a regular point is contained in a simple closed geodesic, then it is contained in infinitely many simple closed geodesics, whose directions are dense in the unit circle. Moreover, the set of…
$ \def\vecc#1{\boldsymbol{#1}} $We design a polynomial time algorithm that for any weighted undirected graph $G = (V, E,\vecc w)$ and sufficiently large $\delta > 1$, partitions $V$ into subsets $V_1, \ldots, V_h$ for some $h\geq 1$, such…
A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…
Let G=(V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v in V dominates its closed neighborhood N[v]. A vertex set D in G is an efficient dominating (e.d.) set for G if for every vertex v in V, there is…
The paper focuses on synthesizing optimal contact curves that can be used to ensure a rolling constraint between two bodies in relative motion. We show that geodesic based contact curves generated on both the contacting surfaces are…
We present an efficient dynamic data structure that supports geodesic nearest neighbor queries for a set of point sites $S$ in a static simple polygon $P$. Our data structure allows us to insert a new site in $S$, delete a site from $S$,…
Our main point of focus is the set of closed geodesics on hyperbolic surfaces. For any fixed integer $k$, we are interested in the set of all closed geodesics with at least $k$ (but possibly more) self-intersections. Among these, we…
Node classification is one of the hottest tasks in graph analysis. Though existing studies have explored various node representations in directed and undirected graphs, they have overlooked the distinctions of their capabilities to capture…