35 search results - page 2 / 7 » cccg 2009 |
CCCG
2009
13 years 6 months ago
2009
We study the emergence of rigid components in an Erdos-R
CCCG
2009
13 years 6 months ago
2009
We prove that, for every two n-node non-star trees of diameter at most four, there exists an n-node planar graph containing them as edge-disjoint subgraphs.
CCCG
2009
13 years 6 months ago
2009
Given 2 homotopic curves in a topological space, there are several ways to measure similarity between the curves, including Hausdorff distance and Fr
CCCG
2009
13 years 6 months ago
2009
-extended abstractMark K
CCCG
2009
13 years 6 months ago
2009
This paper introduces a new measure of quality for terrain surface simplification aiming at preserving the slope of the surface, as well as a new simplification algorithm which sa...