876 search results - page 82 / 176 » Complexity in geometric SINR |
AAAI
2007
14 years 11 days ago
2007
We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...
COMPGEOM
2008
ACM
13 years 12 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
FLAIRS
2004
13 years 11 months ago
2004
Within the geographic domain, an important class of relies on geometric abstractions in the form of lines where, for instance, transportation networks and trajectories of movement...
WSCG
2004
13 years 11 months ago
2004
Rasterization of polygons in 2D is a well known problem, existing several optimal solutions to solve it. The extension of this problem to 3D is more difficult and most existing so...
WSCG
2004
13 years 11 months ago
2004
Freeform feature shape reuse is an important issue in industrial design supporting. In this paper, the frequencybased operators for freeform feature shape reuse are discussed. Unl...