115
click to vote
CCCG
15 years 1 months ago
2007 
We consider the problem of two-dimensional outputsensitive convex hull in the cache-oblivious model. That is, we are interested in minimizing the number of cache faults caused whe...
105
click to vote
CCCG
15 years 1 months ago
2007 
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
107
click to vote
CCCG
15 years 1 months ago
2007 
A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent if for every pair of points p = (x(p), y(p), z(p)) and q = (x(q), y(q), z(q)) on th...
102
click to vote
CCCG
15 years 1 months ago
2007
We present a heuristic algorithm to compute approximate geodesic distances on a triangular manifold S containing n vertices with partially missing data. The proposed method comput...
110
click to vote
CCCG
15 years 1 months ago
2007
Let S be a set system of convex sets in Rd . Helly’s theorem states that if all sets in S have empty intersection, then there is a subset S′ ⊂ S of size d+1 which also has e...
|
Computational Geometry