45 search results - page 4 / 9 » compgeom 2006 |
COMPGEOM
2006
ACM
13 years 9 months ago
2006
ACM
We prove that any collection of n discs in which each one intersects at most k others, can be colored with at most O(log3 k) colors so that for each point p in the union of all di...
COMPGEOM
2006
ACM
14 years 20 hour ago
2006
ACM
Snap Rounding (SR for short) is a method for converting arbitrary-precision arrangements of line segments into a fixed-precision representation. In the previous years two variant...
COMPGEOM
2006
ACM
14 years 20 hour ago
2006
ACM
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
COMPGEOM
2006
ACM
14 years 20 hour ago
2006
ACM
We give the first complete subdivision algorithm for the intersection of two Bezier curves F, G, possibly with tangential intersections. Our approach to robust subdivision algori...
COMPGEOM
2006
ACM
14 years 20 hour ago
2006
ACM
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...