839 search results - page 6 / 168 » Three-Clustering of Points in the Plane |
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
We consider dynamic scenes consisting of moving points whose motion is constrained to happen in one of a pencil of planes. This is for example the case when rigid objects move ind...
JSC
2008
13 years 6 months ago
2008
We compute the singular points of a plane rational curve, parametrically given, using the implicitization matrix derived from the -basis of the curve. It is shown that singularity...
SIAMJO
2000
13 years 7 months ago
2000
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
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 ...
ICCTA
2007
IEEE
14 years 2 months ago
2007
IEEE
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...