CCCG
2007
13 years 7 months ago
2007
Given a surface triangulation T of and a subset X of its vertex set V (T), we define a restricted edge contraction as a contraction of an edge connecting X and V (T)−X. Boundar...
CCCG
2007
13 years 7 months ago
2007
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend during the course of the morph. The morph uses a polynomial ...
CCCG
2007
13 years 7 months ago
2007
A Laman mechanism is a flexible planar bar-and-joint framework with m ≤ 2n−3 edges and exactly k = 2n− m degrees of freedom. The slider-pinning problem is to eliminate all ...
CCCG
2007
13 years 7 months ago
2007
Given a set P of n points in R2 , we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersect...
CCCG
2007
13 years 7 months ago
2007
CCCG
2007
13 years 7 months ago
2007
For every n, we construct two arcs in the four-punctured sphere that have at least n intersections and which do not form spirals. This is accomplished in several steps: we first ...
CCCG
2007
13 years 7 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 7 months ago
2007
Given a convex polyhedron with n vertices and F faces, what is the fewest number of pieces, each of which unfolds to a simple polygon, into which it may be cut by slices along edg...
CCCG
2007
13 years 7 months ago
2007
Given a disk O in the plane called the objective, we want to find n small disks P1, . . . , Pn called the pupils such that n i,j=1 Pi Pj ⊇ O, where denotes the Minkowski diffe...
CCCG
2007
13 years 7 months ago
2007
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...