102
click to vote
CCCG
15 years 1 months 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...
113
click to vote
CCCG
15 years 1 months ago
2009 
In this paper, we present new algorithms for computing maximum perimeter and maximum area of the convex hull of imprecise inputs based on the parallel line segment model. The runn...
CCCG
15 years 1 months ago
2009 
We present a method for extracting contours from digital images using techniques from computational geometry. Our approach is different from traditional pixelbased methods in imag...
CCCG
15 years 1 months ago
2009 114
click to vote
CCCG
15 years 1 months ago
2009
A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to...
|
Computational Geometry