CCCG
2003
13 years 6 months ago
2003
Morphing algorithms aim to construct visually pleasing interpolations (morphs) between 2D or 3D shapes. One of the desirable properties of a morph is avoiding selfintersections of...
CCCG
2003
13 years 6 months ago
2003
We consider the problem of finding the shortest curve in the plane that has unit width. This problem was first posed as the “river shore” puzzle by Ogilvy (1972) and is rela...
CCCG
2003
13 years 6 months ago
2003
Given a polyhedron P in Rd with n vertices, a halfspace volume query asks for the volume of P ∩ H for a given halfspace H. We show that, for d ≥ 3, such queries can require ...
CCCG
2003
13 years 6 months ago
2003
CCCG
2003
13 years 6 months ago
2003
We completely describe the structure of the connected components of transversals to a collection of n arbitrary line segments in R3 . We show that n 3 line segments in R3 admit 0,...
CCCG
2003
13 years 6 months ago
2003
We prove that for any two simple chains [more generally, trees] in Rd with corresponding edges parallel, there is a parallel morph between them—i.e. a morph in which all interme...
CCCG
2003
13 years 6 months ago
2003
We give conditions under which the worst-case size of the silhouette of a polytope is sub-linear.
CCCG
2003
13 years 6 months ago
2003
We pose a monotonicity conjecture on the number of pseudo-triangulations of any planar point set, and check it on two prominent families of point sets, namely the so-called double...
CCCG
2003
13 years 6 months ago
2003
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S, E). For the case that G for...
CCCG
2003
13 years 6 months ago
2003
We present a novel k-dimensional range search algorithm for reporting all k-d rectangles from a set D of size n intersecting a query rectangle. Our algorithm uses 2kd tries to sol...