Sciweavers

557 search results - page 78 / 112
» On the set multi-cover problem in geometric settings
Sort
View
SWAT
1994
Springer
113views Algorithms» more  SWAT 1994»
14 years 1 months ago
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
Stefan Felsner, Rudolf Müller, Lorenz Wernisc...
CVIU
2006
168views more  CVIU 2006»
13 years 9 months ago
Fitting conics to paracatadioptric projections of lines
The paracatadioptric camera is one of the most popular panoramic systems currently available in the market. It provides a wide field of view by combining a parabolic shaped mirror...
João P. Barreto, Helder Araújo
CVPR
2005
IEEE
14 years 11 months ago
Shape Matching and Object Recognition Using Low Distortion Correspondences
We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up corres...
Alexander C. Berg, Tamara L. Berg, Jitendra Malik
ICCSA
2003
Springer
14 years 2 months ago
Web Visualization of Function-Defined Shapes
Abstract. This paper describes how function-based shape modeling can be expanded to web visualization, as well as how web-based visualization can be greatly improved by using the f...
Alexei Sourin, Lai Feng Min, Konstantin Levinski
COMPGEOM
2005
ACM
13 years 11 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg