Related papers: Finding a Curve in a Point Set
A new class of geometric query problems are studied in this paper. We are required to preprocess a set of geometric objects $P$ in the plane, so that for any arbitrary query point $q$, the largest circle that contains $q$ but does not…
Let $P$ be a simple polygon of $n$ vertices. We consider two-point $L_1$ shortest path queries in $P$. We build a data structure of $O(n)$ size in $O(n)$ time such that given any two query points $s$ and $t$, the length of an $L_1$ shortest…
Map matching is a common preprocessing step for analysing vehicle trajectories. In the theory community, the most popular approach for map matching is to compute a path on the road network that is the most spatially similar to the…
We provide a solution method for the polyhedral convex set optimization problem, that is, the problem to minimize a set-valued mapping with polyhedral convex graph with respect to a set ordering relation which is generated by a polyhedral…
The free space diagram is a popular tool to compute the well-known Fr\'echet distance. As the Fr\'echet distance is used in many different fields, many variants have been established to cover the specific needs of these applications. Often,…
Given a curve $P$ with points in $\mathbb{R}^d$ in a streaming fashion, and parameters $\varepsilon>0$ and $k$, we construct a distance oracle that uses $O(\frac{1}{\varepsilon})^{kd}\log\varepsilon^{-1}$ space, and given a query curve $Q$…
Visual data, such as an image or a sequence of video frames, is often naturally represented as a point set. In this paper, we consider the fundamental problem of finding a nearest set from a collection of sets, to a query set. This problem…
Given a simple polygon $P$ and a set $Q$ of points contained in $P$, we consider the geodesic $k$-center problem where we want to find $k$ points, called \emph{centers}, in $P$ to minimize the maximum geodesic distance of any point of $Q$…
If a smooth, closed, and embedded curve is deformed along its normal vector field at a rate proportional to its curvature, it shrinks to a circular point. This curve evolution is called Euclidean curve shortening and the result is known as…
Two curves are affinely equivalent if there exists an affine mapping transforming one of them onto the other. Thus, detecting affine equivalence comprises, as important particular cases, similarity, congruence and symmetry detection. In…
Suppose $\mathcal{X}$ is an $n$-correct set of nodes in the plane, that is, it admits a unisolvent interpolation with bivariate polynomials of total degree less than or equal to $n.$ Then an algebraic curve $q$ of degree $k\le n$ can pass…
Under conditions that prevent tangential intersection, we prove quadratic convergence of a projection algorithm for the feasibility problem of finding a point in the intersection of a smooth curve and line in $\mathbb{R}^2$. This nonconvex…
This is an extended version of an invited lecture I gave at the Journees Arithmetiques in St. Etienne in July 2009. We discuss the state of the art regarding the problem of finding the set of rational points on a (smooth projective)…
This paper addresses the problem of determining the symmetries of a plane or space curve defined by a rational parametrization. We provide effective methods to compute the involution and rotation symmetries for the planar case. As for space…
Given a simple polygon $\mathcal{P}$ on $n$ vertices, two points $x,y$ in $\mathcal{P}$ are said to be visible to each other if the line segment between $x$ and $y$ is contained in $\mathcal{P}$. The Point Guard Art Gallery problem asks for…
Solution and analysis of mathematical programming problems may be simplified when these problems are symmetric under appropriate linear transformations. In particular, a knowledge of the symmetries may help reduce the problem dimension, cut…
Many application areas collect unstructured trajectory data. In subtrajectory clustering, one is interested to find patterns in this data using a hybrid combination of segmentation and clustering. We analyze two variants of this problem…
In this paper, we investigate the homothetic point enclosure problem: given a set $S$ of $n$ triangles with sides parallel to three fixed directions, find a data structure for $S$ that can report all the triangles of $S$ that contain a…
We introduce one dimensional sets to help describe and constrain the integral curves of an $n$ dimensional dynamical system. These curves provide more information about the system than the zero-dimensional sets (fixed points) do. In fact,…
We consider the problem of constructing an approximation of the Pareto curve associated with the multiobjective optimization problem $\min_{\mathbf{x} \in \mathbf{S}}\{ (f_1(\mathbf{x}), f_2(\mathbf{x})) \}$, where $f_1$ and $f_2$ are two…