30 search results - page 2 / 6 » On the Geometric Dilation of Finite Point Sets |
CCCG
2009
15 years 24 days ago
2009
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
94
Voted
GD
2006
Springer
15 years 3 months ago
2006
Springer
We give a brief account of results concerning the number of triangulations on finite point sets in the plane, both for arbitrary sets and for specific sets such as the n
82
Voted
CCCG
2010
15 years 1 months ago
2010
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by ha...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...
101
click to vote
CG
2004
Springer
14 years 11 months ago
2004
Springer
We present a framework for processing point-based surfaces via partial differential equations (PDEs). Our framework efficiently and effectively brings well-known PDE-based process...