Sciweavers

839 search results - page 43 / 168
» Three-Clustering of Points in the Plane
Sort
View
DAM
2007
88views more  DAM 2007»
13 years 9 months ago
Digital planarity - A review
Digital planarity is defined by digitizing Euclidean planes in the three-dimensional digital space of voxels; voxels are given either in the grid point or the grid cube model. Th...
Valentin E. Brimkov, David Coeurjolly, Reinhard Kl...
ACCV
2010
Springer
13 years 4 months ago
Planar Affine Rectification from Change of Scale
A method for affine rectification of a plane exploiting knowledge of relative scale changes is presented. The rectifying transformation is fully specified by the relative scale cha...
Ondrej Chum, Jiri Matas
SIAMDM
2011
13 years 4 months ago
On Maximal S-Free Convex Sets
Let S ⊆ Zn satisfy the property that conv(S) ∩ Zn = S. Then a convex set K is called an S-free convex set if int(K) ∩ S = ∅. A maximal S-free convex set is an S-free convex...
Diego A. Morán R., Santanu S. Dey
DCG
2010
93views more  DCG 2010»
13 years 9 months ago
The Number of Generalized Balanced Lines
Let S be a set of r red points and b = r +2 blue points in general position in the plane. A line determined by them is said to be balanced if in each open half-plane bounded by th...
David Orden, Pedro Ramos, Gelasio Salazar
CCCG
1996
13 years 10 months ago
Computing the Angularity Tolerance
In computational metrology one needs to compute whether an object satis es speci cations of shape within an acceptable tolerance. To this end positions on the object are measured,...
Mark de Berg, Henk Meijer, Mark H. Overmars, Gordo...