235 search results - page 28 / 47 » On joint triangulations of two sets of points in the plane |
BMCBI
2007
13 years 6 months ago
2007
Background: Microarray compendia profile the expression of genes in a number of experimental conditions. Such data compendia are useful not only to group genes and conditions base...
EJC
2010
13 years 6 months ago
2010
The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex poly...
GD
2009
Springer
13 years 11 months ago
2009
Springer
Let n ≥ 4 be even. It is shown that every set S of n points in the plane can be connected by a (possibly self-intersecting) spanning tour (Hamiltonian cycle) consisting of n str...
GD
2007
Springer
14 years 27 days ago
2007
Springer
We present new algorithms for labeling a set P of n points in the plane with labels that are aligned to the left of the bounding box of P. The points are connected to their labels ...
ICRA
2009
IEEE
14 years 1 months ago
2009
IEEE
—This paper presents HSM3D, an algorithm for global rigid 6DOF alignment of 3D point clouds. The algorithm works by projecting the two input sets into the Radon/Hough domain, who...