150 search results - page 4 / 30 » Traversing a set of points with a minimum number of turns |
CCCG
2010
13 years 6 months ago
2010
In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that...
COMGEO
2004
ACM
13 years 5 months ago
2004
ACM
The number of minimum pseudo-triangulations is minimized for point sets in convex position. 2004 Elsevier B.V. All rights reserved.
SODA
2004
ACM
13 years 6 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
CORR
2011
Springer
13 years 10 days ago
2011
Springer
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...
ARSCOM
2000
13 years 5 months ago
2000
The minimum number of incomplete blocks required to cover, exactly times, all t-element subsets from a set V of cardinality v (v > t) is denoted