Selected

Traditional problems in computational geometry involve aspects that are both discrete and continuous. One such example is …

It is widely believed that natural image data exhibits low-dimensional structure despite the high dimensionality of conventional pixel …

Approximate nearest-neighbor search is a fundamental algorithmic problem that continues to inspire study due its essential role in …

Despite the vulnerability of object detectors to adversarial attacks, very few defenses are known to date. While adversarial training …

Adversarial patch attacks are among one of the most practical threat models against real-world computer vision systems. This paper …

Polyhedral meshes are increasingly becoming an attractive option with particular advantages over traditional meshes for certain …

Low-cost mini-drones with advanced sensing and maneuverability enable a new class of intelligent sensing systems. To achieve the full …

We present a new approach to $\varepsilon$-approximate nearest-neighbor queries in fixed dimension under a variety of non-Euclidean …

We study a two-player pursuit-evasion game, in which an agent moving amongst obstacles is to be maintained within “sight” …