Related papers: Dominance for Containment Problems
We propose a new algorithm for finding an unknown number of geometric models, e.g., homographies. The problem is formalized as finding dominant model instances progressively without forming crisp point-to-model assignments. Dominant…
This paper presents decentralized algorithms for formation control of multiple robots in three dimensions. Specifically, we leverage the mathematical properties of cyclic pursuit along with results from contraction and partial contraction…
Many geometric optimization problems can be reduced to finding points in space (centers) minimizing an objective function which continuously depends on the distances from the centers to given input points. Examples are $k$-Means, Geometric…
In the last few years, there has been a growing interest in taking advantage of the 360 panoramic images potential, while managing the new challenges they imply. While several tasks have been improved thanks to the contextual information…
High-energy physics detectors, images, and point clouds share many similarities in terms of object detection. However, while detecting an unknown number of objects in an image is well established in computer vision, even machine learning…
Consider a set $P$ of $n$ points on the boundary of an axis-aligned square $Q$. We study the boundary-anchored packing problem on $P$ in which the goal is to find a set of interior-disjoint axis-aligned rectangles in $Q$ such that each…
Covering problems belong to the foundation of graph theory. There are several types of covering problems in graph theory such as covering the vertex set by stars (domination problem), covering the vertex set by cliques (clique covering…
To endow machines with the ability to perceive the real-world in a three dimensional representation as we do as humans is a fundamental and long-standing topic in Artificial Intelligence. Given different types of visual inputs such as…
Preference orderings are orderings of a set of items according to the preferences (of judges). Such orderings arise in a variety of domains, including group decision making, consumer marketing, voting and machine learning. Measuring the…
We study the problem of moving a vertex in an unstructured mesh of triangular, quadrilateral, or tetrahedral elements to optimize the shapes of adjacent elements. We show that many such problems can be solved in linear time using…
We study a natural generalization of the classical \textsc{Dominating Set} problem, called \textsc{Dominating Set with Quotas} (DSQ). In this problem, we are given a graph \( G \), an integer \( k \), and for each vertex \( v \in V(G) \), a…
In this paper, we study the parameterized complexity of a generalized domination problem called the [${\sigma}, {\rho}$] Dominating Set problem. This problem generalizes a large number of problems including the Minimum Dominating Set…
At a first glance, the problem of illuminating the boundary of a convex body by external light sources and the problem of covering a convex body by its smaller positive homothetic copies appear to be quite different. They are in fact two…
We present polynomial-time approximation schemes based on local search} technique for both geometric (discrete) independent set (\mdis) and geometric (discrete) dominating set (\mdds) problems, where the objects are arbitrary radii disks…
Non-dominated sorting is a fundamental combinatorial problem in multiobjective optimization, and is equivalent to the longest chain problem in combinatorics and random growth models for crystals in materials science. In a previous work, we…
We propose a method that learns to camouflage 3D objects within scenes. Given an object's shape and a distribution of viewpoints from which it will be seen, we estimate a texture that will make it difficult to detect. Successfully solving…
We consider the 2-limited packing problem: for a graph $G=(V,E)$ one seeks to find a maximum cardinality subset $B\subseteq V$, such that, for all $v\in V$, the closed neighbourhood of $v$ contains at most two vertices in $B$. We compare…
In the point set embeddability problem, we are given a plane graph $G$ with $n$ vertices and a point set $S$ with $n$ points. Now the goal is to answer the question whether there exists a straight-line drawing of $G$ such that each vertex…
For general multi-objective optimization problems, we propose a novel performance metric called domination measure to measure the quality of a solution, which can be intuitively interpreted as the size of the portion of the solution space…
In this paper, we deal with the containment control problem in presence of antagonistic interactions. In particular, we focus on the cases in which it is not possible to contain the entire network due to a constrained number of control…