ZeroTouch: an optical multi-touch and free-air interaction architecture

J Moeller, A Kerne - Proceedings of the SIGCHI Conference on Human …, 2012 - dl.acm.org
ZeroTouch (ZT) is a unique optical sensing technique and architecture that allows precision
sensing of hands, fingers, and other objects within a constrained 2-dimensional plane …

The forest hiding problem

A Dumitrescu, M Jiang - Discrete & Computational Geometry, 2011 - Springer
Let Ω be a disk of radius R in the plane. A set F of unit disks contained in Ω forms a maximal
packing if the unit disks are pairwise interior-disjoint and the set is maximal, ie, it is not …

Object detection in flatland

N Jovanovic, J Korst, V Pronk - 2009 Third International …, 2009 - ieeexplore.ieee.org
Given a rectangle with emitters and receivers on its perimeter, one can detect objects in it by
determining which of the line segments between emitters and receivers are blocked by …

[PDF][PDF] Finding Shadows among Disks.

N Jovanovic, JHM Korst, Z Aleksovski, W Michiels… - CCCG, 2012 - 2012.cccg.ca
Given a set of n non-overlapping unit disks in the plane, a line l is called blocked if it
intersects at least one of the disks and a point p is called a shadow point if all lines …

[PDF][PDF] Hiding in the Crowd: Asymptotic Bounds on Blocking Sets

N Jovanovic, J Korst, Z Aleksovski, R Jovanovic - academia.edu
We consider the problem of blocking all rays emanating from a unit disk U by a minimum
number Nd of unit disks in the two-dimensional space, where each disk has at least a …

[PDF][PDF] Dumitrescu, Adrian (1-WIM-C); Jiang, Minghui [Jiang, Minghui 2](1-UTS-C)

Y Zhang - Discrete Comput. Geom, 2011 - Citeseer
In this paper, the authors solve an illumination problem for maximal unit disk packings. Let Ω
be a disk of radius R in the plane. A set F of unit disks contained in Ω forms a maximal …

The forest hiding problem:—An illumination problem for maximal disk packings—

A Dumitrescu, M Jiang - Proceedings of the Twenty-First Annual ACM-SIAM …, 2010 - SIAM
Let Ω be a disk of radius R in the plane. A set F of closed unit disks contained in Ω forms a
maximal packing if the unit disks are pairwise disjoint and the set is maximal: ie, it is not …

Asymptotic bounds on minimum number of disks required to hide a disk

N Jovanovic, JHM Korst, Z Aleksovski… - conference; ADVCOMP …, 2010 - research.tue.nl
We consider the problem of blocking all rays emanating from a closed unit disk with a
minimum number of closed unit disks in the two-dimensional space, where the minimum …