CCCG
2006
13 years 5 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 5 months ago
2006
A flip or edge-replacement is considered as a transformation by which one edge e of a geometric object is removed and an edge f (f = e) is inserted such that the resulting object ...
CCCG
2006
13 years 5 months ago
2006
A room is a simple polygon with a prespecified point, called the door, on its boundary. A search starts at the door and must detect any intruder that may be in the room, while maki...
CCCG
2006
13 years 5 months ago
2006
For a given point set in Euclidean space we consider the problem of finding (approximate) nearest neighbors of a query point but restricting only to points that lie within a fixed...
CCCG
2006
13 years 5 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 5 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 ...
CCCG
2006
13 years 5 months ago
2006
CCCG
2006
13 years 5 months ago
2006
We present a generalization of Welzl's smallest enclosing disk algorithm [E. Welzl, Smallest enclosing disks (balls and ellipsoids), in: New Results and New Trends in Compute...
CCCG
2006
13 years 5 months ago
2006
In a range-aggegate query problem we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain intersection or proximity query on the o...
CCCG
2006
13 years 5 months ago
2006
We study the relationship between the interior angles of a convex polygon and the lengths of external watchman routes.