727 search results - page 24 / 146 » One line and n points |
DAM
2006
15 years 13 days ago
2006
To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gon...
COMPGEOM
2007
ACM
15 years 4 months ago
2007
ACM
Given a finite set of points S in Rd , consider visiting the points in S with a polygonal path which makes a minimum number of turns, or equivalently, has the the minimum number o...
123
Voted
CCCG
2003
15 years 1 months ago
2003
In this paper we consider the problem of computing the closest point to the boundary of a circle among a set S of n points. We present two algorithms to solve this problem. One al...
102
click to vote
SODA
1997
ACM
15 years 1 months ago
1997
ACM
In this paper we examine problems motivated by on-line financial problems and stochastic games. In particular, we consider a sequence of entirely arbitrary distinct values arrivin...
145
click to vote
IPCO
2001
15 years 1 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...