Sciweavers

37 search results - page 5 / 8
» Smallest Enclosing Cylinders
Sort
View
CCCG
1993
13 years 8 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
AAAI
2006
13 years 9 months ago
Algorithms for Rationalizability and CURB Sets
Significant work has been done on computational aspects of solving games under various solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated eq...
Michael Benisch, George B. Davis, Tuomas Sandholm
AIPS
2003
13 years 9 months ago
Optimal Rectangle Packing: Initial Results
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...
Richard E. Korf
ALGORITHMICA
2008
79views more  ALGORITHMICA 2008»
13 years 7 months ago
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kast...
GI
2009
Springer
14 years 4 days ago
Tracking an Extended Object Modeled as an Axis-Aligned Rectangle
: In many tracking applications, the extent of the target object is neglected and it is assumed that the received measurements stem from a point source. However, modern sensors are...
Marcus Baum, Uwe D. Hanebeck