Sciweavers

235 search results - page 19 / 47
» On joint triangulations of two sets of points in the plane
Sort
View
ICPR
2010
IEEE
13 years 10 months ago
Triangle-Constraint for Finding More Good Features
We present a novel method for finding more good feature pairs between two sets of features. We first select matched features by Bi-matching method as seed points, then organize th...
Xiaojie Guo, Xiaochun Cao
COMPGEOM
2010
ACM
13 years 12 months ago
Points with large quadrant-depth
We characterize the set of all pairs (a, b) such that for every set P of n points in general position in R2 there always exists a point p ∈ P and two opposite quadrants determin...
Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Rom ...
COMPGEOM
1991
ACM
13 years 10 months ago
Crossing Families
Given a set of points in the plane, a crossing family is a collection of line segments, each joining two of the points, such that any two line segments intersect internally. Two s...
Boris Aronov, Paul Erdös, Wayne Goddard, Dani...
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
14 years 1 months ago
Resolving Loads with Positive Interior Stresses
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
Günter Rote, André Schulz
ICPR
2000
IEEE
14 years 7 months ago
Using Geometric Constraints for Matching Disparate Stereo Views of 3D Scenes Containing Planes
Several vision tasks rely upon the availability of sets of corresponding features among images. This paper presents a method which, given some corresponding features in two stereo...
Manolis I. A. Lourakis, Stavros V. Tzurbakis, Anto...