233 search results - page 41 / 47 » cccg 2007 |
CCCG
2007
13 years 8 months ago
2007
We consider the problem of determining the placement of a star R on a set P of n points in the plane such that a given objective function is maximized. A star R is a set of m rays...
CCCG
2007
13 years 8 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...
CCCG
2007
13 years 8 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...
CCCG
2007
13 years 8 months ago
2007
Given a sequence of n real numbers a1, a2, a3, . . . , an, the maximum segment sum problem is that of determining indices i and j (1 ≤ i ≤ j ≤ n) such that the sum s(i, j) =...
CCCG
2007
13 years 8 months ago
2007
We study the problem of drawing a graph-theoretic path where each edge is assigned an axis-parallel direction in 3D. Di Battista et al.[3] gives a combinatorial characterization f...