235 search results - page 15 / 47 » The Complexity of Separating Points in the Plane |
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
63
Voted
CCCG
2008
14 years 11 months ago
2008
In this paper we investigate the Voronoi diagram that is induced by a set of sites in the plane, where each site's precise location is uncertain but is known to be within a p...
107
click to vote
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
In the perspective next generation Air Traffic Management (ATM) systems, aircraft will be endowed with part of the responsibility for separation maintenance, and traffic complexity...
JDA
2010
14 years 8 months ago
2010
We introduce and analyze σ-local graphs, based on a definition of locality by Erickson [12]. We present two algorithms to construct such graphs, for any real number σ > 1 an...
82
Voted
CAD
2006
Springer
14 years 9 months ago
2006
Springer
Presented in this paper is a sweepline algorithm to compute the Voronoi diagram of a set of circles in a two-dimensional Euclidean space. The radii of the circles are non-negative...