39 search results - page 5 / 8 » cccg 2006 |
CCCG
2006
13 years 11 months ago
2006
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
CCCG
2006
13 years 11 months ago
2006
We study the graph partitioning problem on ddimensional ball graphs in a geometric way. Let B be a set of balls in d-dimensional Euclidean space with radius ratio and -precision....
CCCG
2006
13 years 11 months ago
2006
In their paper on delineating boundaries from geographic data, Reinbacher et al. [9] use a recolouring method to reclassify points so that the boundaries that separate points of d...
CCCG
2006
13 years 11 months ago
2006
Suppose intruders are in a dark polygonal room and they can move at a finite but unbounded speed, trying to avoid detection. A boundary 1-searcher can move along the polygon bounda...
CCCG
2006
13 years 11 months ago
2006
In this paper we study various predicates concerning line transversals to lines and segments in 3D. We compute the degrees of standard methods of evaluating these predicates. The ...