Sciweavers

1672 search results - page 38 / 335
» Tightness problems in the plane
Sort
View
IPCO
2008
105views Optimization» more  IPCO 2008»
13 years 10 months ago
Can Pure Cutting Plane Algorithms Work?
We discuss an implementation of the lexicographic version of Gomory's fractional cutting plane method and of two heuristics mimicking the latter. In computational testing on a...
Arrigo Zanette, Matteo Fischetti, Egon Balas
SODA
2008
ACM
123views Algorithms» more  SODA 2008»
13 years 10 months ago
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
Xiaomin Chen, János Pach, Mario Szegedy, G&...
SAC
2010
ACM
13 years 3 months ago
Similar triangles and orientation in plane elementary geometry for Coq-based proofs
In plane elementary geometry, the concept of similar triangles not only forms an important foundation for trigonometry, but it also can be used to solve many geometric problems. T...
Tuan Minh Pham
ICPR
2000
IEEE
14 years 9 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...
COMPGEOM
1990
ACM
14 years 25 days ago
Minimum-Link Paths Among Obstacles in the Plane
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
Joseph S. B. Mitchell, Günter Rote, Gerhard J...