66 search results - page 6 / 14 » cccg 2010 |
CCCG
2010
14 years 11 months ago
2010
In this work we describe a general algorithm to find a finite-element basis with minimum total support for an arbitrary spline space, given any basis for that same space. The runn...
CCCG
2010
14 years 11 months ago
2010
The straight skeleton of a simple polygon is defined as the trace of the vertices when the initial polygon is shrunken in self-parallel manner [2]. In this paper, we propose a sim...
CCCG
2010
14 years 11 months ago
2010
We examine the problem of pushing all the points of a planar region into one point using parallel sweeps of an infinite line, minimizing the sum of the lengths of the sweep vector...
CCCG
2010
14 years 11 months ago
2010
We show that the size of the perimeter of (, )-covered objects is a linear function of the diameter. Specifically, for an (, )-covered object O, per(O) c diam(O) sin2 , for a pos...
CCCG
2010
14 years 11 months ago
2010
The cluster connecting problem inside a simple polygon is introduced in this paper. The problem is shown to be NP-complete. A log n-factor approximation algorithm is proposed.