233 search results - page 35 / 47 » cccg 2007 |
CCCG
2006
13 years 8 months ago
2006
Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...
CCCG
2001
13 years 8 months ago
2001
We show that every set of n points in general position has a minimum pseudo-triangulation whose maximum vertex degree is five. In addition, we demonstrate that every point set in ...
CCCG
2001
13 years 8 months ago
2001
This paper describes a solution to the nearest neighbor problem. The proposed algorithm, which makes use of the triangle inequality property, is considered from a function minimiz...
CCCG
2003
13 years 8 months ago
2003
We prove that for any two simple chains [more generally, trees] in Rd with corresponding edges parallel, there is a parallel morph between them—i.e. a morph in which all interme...
CCCG
2003
13 years 8 months ago
2003
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....