727 search results - page 23 / 146 » One line and n points |
GD
2009
Springer
15 years 2 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...
SCALESPACE
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. We introduce a novel implicit approach for surface patch segmentation in 3D images starting from a single point. Since the boundary surface of an object is locally homeom...
DM
2008
14 years 10 months ago
2008
One proves that certain numbers occurring in a problem of paths enumeration, studied by Niederhausen in [7] (see also [10]), are top intersection numbers in the cohomology ring of...
VAMOS
2010
Springer
14 years 11 months ago
2010
Springer
Abstract--One of the design goals of Product Line Architectures (PLAs) is to remain stable while accommodating changes of stakeholder's requirements. However, the stability of...
FSTTCS
2007
Springer
15 years 4 months ago
2007
Springer
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...