—Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source-destination pair. It is desirable that graph embeddings a...
The cognitively motivated principle of polyrepresentation still lacks a theoretical foundation in IR. In this work, we discuss two competing polyrepresentation frameworks that are ...
Estimating intrinsic geometric properties of a surface from a polygonal mesh obtained from range data is an important stage of numerous algorithms in computer and robot vision, co...
In this paper we study inversions within restricted fillings of Young tableaux. These restricted fillings are of interest because they describe geometric properties of certain sub...
In most previous NPR line rendering systems, geometric properties have been directly used to extract and stylize certain edges. However, this approach is bound to a tight stylizat...
We propose a new rendering technique that produces 3-D images with enhanced visual comprehensibility. Shape features can be readily understood if certain geometric properties are ...
In the development of algorithms for finding the minimal solutions of systems of linear Diophantine equations, little use has been made (to our knowledge) of the results by Stanle...
During teleoperation, a human operator often receives only 2-D visual feedback from the remote environment. While a variety of kinematic sensors exist on the remote manipulator fo...
Estimating intrinsic geometric properties of a surface from a polygonal mesh obtained from range data is an important stage of numerous algorithms in computer and robot vision, co...
We consider selected geometric properties of 2D or 3D sets, given in form of binary digital pictures, and discuss their estimation. The properties examined are perimeter and area i...