150 search results - page 3 / 30 » Traversing a set of points with a minimum number of turns |
CCCG
2009
13 years 6 months ago
2009
Given n points in the plane, we study three optimization problems of computing an empty pseudo-triangle: we consider minimizing the perimeter, maximizing the area, and minimizing ...
IMC
2003
ACM
13 years 10 months ago
2003
ACM
Internet topology information is only made available in aggregate form by standard routing protocols. Connectivity information and latency characteristicsmust therefore be inferre...
GD
2005
Springer
13 years 10 months ago
2005
Springer
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
IWPEC
2004
Springer
13 years 10 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...