38 search results - page 6 / 8 » Visibility Computations: From Discrete Algorithms to Real Al... |
COMPGEOM
2010
ACM
14 years 18 days ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
PRESENCE
2002
13 years 7 months ago
2002
Diminished reality is as important as augmented reality, and both are possible with a device called the Reality Mediator. Over the past two decades, we have designed, built, worn,...
COMPGEOM
2010
ACM
14 years 18 days ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
HYBRID
2010
Springer
14 years 2 months ago
2010
Springer
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...