CCCG
2003
14 years 25 days 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
14 years 25 days ago
2003
We give conditions under which the worst-case size of the silhouette of a polytope is sub-linear.
CCCG
2003
14 years 25 days 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
14 years 25 days 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
14 years 25 days 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...
CCCG
2001
14 years 25 days ago
2001
We study combinatorial bounds for geometric permutations of balls with bounded size disparity in d-space. Our main contribution is the following theorem: given a set S of n disjoi...
CCCG
2001
14 years 25 days ago
2001
This paper is concerned with applications of Tutte's barycentric embedding theorem (Proc. London Math. Soc. 13 (1963), 743
CCCG
2001
14 years 25 days ago
2001
This paper describes a solution to the nearest neighbor problem. The proposed algorithm, which makes use of the triangle inequality property, is considered from a function minimiz...
CCCG
2001
14 years 25 days ago
2001
CCCG
2001
14 years 25 days ago
2001
We show that every set of n points in general position has a minimum pseudo-triangulation whose maximum vertex degree is five. In addition, we demonstrate that every point set in ...