A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially usef...
We discuss and prove the correctness of a transaction model for mobile computing. In our transaction model, we incorporate a prewrite operation (before a write) which does not upda...
We consider non-Horn Deductive Data Bases (DDB) represented in a First Order language without function symbols. In this context the DDB is an incomplete description of the world. ...
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
We study the computation of rotation-invariant similarity measures of convex polyhedra, based on Minkowski's theory of mixed volumes. To compute the similarity measure, a (mix...