Sciweavers

137 search results - page 1 / 28
» Maintaining the Approximate Width of a Set of Points in the ...
Sort
View
CCCG
1993
13 years 6 months ago
Maintaining the Approximate Width of a Set of Points in the Plane
d abstract) Gunter Rotey Christian Schwarzz Jack Snoeyinkx The width of a set of n points in the plane is the smallest distance between two parallel lines that enclose the set. W...
Günter Rote, Christian Schwarz, Jack Snoeyink
COMPGEOM
2007
ACM
13 years 9 months ago
A space-optimal data-stream algorithm for coresets in the plane
Given a point set P R2 , a subset Q P is an -kernel of P if for every slab W containing Q, the (1+)-expansion of W also contains P. We present a data-stream algorithm for mainta...
Pankaj K. Agarwal, Hai Yu
IJCGA
2007
58views more  IJCGA 2007»
13 years 5 months ago
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint
Given a set of n points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint q and efficiently maintaining this ordering inform...
Olivier Devillers, Vida Dujmovic, Hazel Everett, S...
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 5 months ago
The Plane-Width of Graphs
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...
Marcin Kaminski, Paul Medvedev, Martin Milanic