Related papers: How to Reconstruct a Planar Map From its Branching…
Let $R=K[x,y,z]$. A reduced plane curve $C=V(f)\subset \mathbf P^2$ is $free \ $ if its associated module of tangent derivations $\mathrm{Der}(f)$ is a free $R$-module, or equivalently if the corresponding sheaf $T_ {\mathbf P^2 }(-\log C)$…
Large-scale vector mapping is important for transportation, city planning, and survey and census. We propose GraphMapper, a unified framework for end-to-end vector map extraction from satellite images. Our key idea is a novel unified…
By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which…
This paper describes a revision of the classic Lazy Probabilistic Roadmaps algorithm (Lazy PRM), that results from pairing PRM and a novel Branch-and-Cut (BC) algorithm. Cuts are dynamically generated constraints that are imposed on minimum…
In the design and analysis of political redistricting maps, it is often useful to be able to sample from the space of all partitions of the graph of census blocks into connected subgraphs of equal population. There are influential Markov…
Clustering is one of the fundamental tasks in data analytics and machine learning. In many situations, different clusterings of the same data set become relevant. For example, different algorithms for the same clustering task may return…
The 2x2 space-filling curve is a type of generalized space-filling curve characterized by a basic unit is in a "U-shape" that traverses a 2x2 grid. In this work, we propose a universal framework for constructing general 2x2 curves where…
We derive an algorithm to determine recursively the lap number (minimal number of monotone pieces) of the iterates of unimodal maps of an interval with free end-points. The algorithm is obtained by the sign analysis of the itineraries of…
We propose a simple, geometrically-motivated construction of smooth random paths in the plane. The construction is such that, with probability one, the paths have finite curvature everywhere (and the realizations are visually pleasing when…
We discuss the task of reconstructing the topological map of an environment based on the sequences of locations visited by a mobile agent -- this occurs in systems neuroscience, where one runs into the task of reconstructing the global…
In this work, we present a novel approach for reconstructing shape point clouds using planar sparse cross-sections with the help of generative modeling. We present unique challenges pertaining to the representation and reconstruction in…
We consider the general problem of enumerating branched covers of the projective line from a fixed general curve subject to ramification conditions at possibly moving points. Our main computations are in genus 1; the theory of limit linear…
In this article we study the possibilities of recovering the structure of port-Hamiltonian systems starting from ``unlabelled'' ordinary differential equations describing mechanical systems. The algorithm we suggest solves the problem in…
In this paper, we present an approach to enhance and improve the current normal map rendering technique. Our algorithm is based on semi-discrete Optimal Mass Transportation (OMT) theory and has a solid theoretical base. The key difference…
Normal map is an important and efficient way to represent complex 3D models. A designer may benefit from the auto-generation of high quality and accurate normal maps from freehand sketches in 3D content creation. This paper proposes a deep…
Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…
We present an explicit method that, given a generic tuple of Dixmier-Ohno invariants, reconstructs a corresponding plane quartic curve.
In this note we compute some enumerative invariants of real and complex projective spaces by means of some enriched graphs called floor diagrams.
We study the ramification divisors of projections of a smooth projective variety onto a linear subspace of the same dimension. We prove that the ramification divisors vary in a maximal dimensional family for a large class of varieties.…
We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…