1672 search results - page 103 / 335 » Tightness problems in the plane |
94
Voted
CCCG
2008
15 years 16 days ago
2008
We consider the problem of finding a shortest rectilinear Steiner tree for a given set of points in the plane in the presence of rectilinear obstacles that must be avoided. We ext...
FCS
2006
15 years 14 days ago
2006
In this paper, we concentrate on the problem of computing a Voronoi diagram using Hypercube model of computation. The main contribution of this work is the O(log3 n) parallel algor...
133
click to vote
ESA
2010
Springer
15 years 5 days ago
2010
Springer
We consider the Minimum Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rect...
77
Voted
ECCV
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. This paper addresses the problem of registering a 3D model, represented as a cloud of points lying over a surface, to a set of 2D deforming image trajectories in the imag...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
In many physical statistical, biological and other investigations it is desirable to approximate a system of points by objects of lower dimension and/or complexity. For this purpo...