73 search results - page 8 / 15 » Time Convex Hull with a Highway |
CCCG
2006
13 years 8 months ago
2006
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
DCG
2010
13 years 7 months ago
2010
Given any > 0 and any planar region bounded by a simple n-gon P we construct a (1 + )-quasiconformal map between and the unit disk in time C()n. One can take C() = C + C log ...
IJDAR
2010
13 years 4 months ago
2010
We study online classification of isolated handwritten symbols using distance measures on spaces of curves. We compare three distance-based measures on a vector space representatio...
IWPEC
2004
Springer
14 years 22 days ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
SASO
2008
IEEE
14 years 1 months ago
2008
IEEE
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...