Sciweavers

839 search results - page 154 / 168
» Three-Clustering of Points in the Plane
Sort
View
COMBINATORICS
1998
89views more  COMBINATORICS 1998»
13 years 7 months ago
Venn Diagrams with Few Vertices
An n-Venn diagram is a collection of n finitely-intersecting simple closed curves in the plane, such that each of the 2n sets X1 ∩X2 ∩· · ·∩Xn, where each Xi is the open...
Bette Bultena, Frank Ruskey
COMGEO
1998
ACM
13 years 7 months ago
The union of moving polygonal pseudodiscs - Combinatorial bounds and applications
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with xed velocities in xed directions. We prove that the maximumnumber of combinatorial chan...
Mark de Berg, Hazel Everett, Leonidas J. Guibas
IVC
1998
90views more  IVC 1998»
13 years 7 months ago
Towards robust metric reconstruction via a dynamic uncalibrated stereo head
We consider the problem of metrically reconstructing a scene viewed by a moving stereo head. The head comprises two cameras with coplanar optical axes arranged on a lateral rig, e...
Michael J. Brooks, Lourdes de Agapito, D. Q. Huynh...
TSMC
1998
92views more  TSMC 1998»
13 years 7 months ago
Solving the orientation-duality problem for a circular feature in motion
Circular features have been commonly used in numerous computer vision application areas for 3-D pose estimation. However, the estimation of such a feature’s pose from 2-D image ...
D. He, Beno Benhabib
MP
2007
97views more  MP 2007»
13 years 7 months ago
On the domino-parity inequalities for the STSP
Abstract One method which has been used very successfully for finding optimal and provably good solutions for large instances of the Symmetric Travelling Salesman Problem (STSP) i...
Sylvia C. Boyd, Sally Cockburn, Danielle Vella