CCCG
2008
13 years 6 months ago
2008
We investigate the problem of finding orthogonal polygons that fold to plural incongruent orthogonal boxes. There are two known polygons that fold to produce two incongruent ortho...
CCCG
2008
13 years 6 months ago
2008
We study a new variant of colored orthogonal range searching problem: given a query rectangle Q all colors c, such that at least a fraction of all points in Q are of color c, mus...
CCCG
2008
13 years 6 months ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
CCCG
2008
13 years 6 months ago
2008
CCCG
2008
13 years 6 months ago
2008
CCCG
2008
13 years 6 months ago
2008
We present the first spatially adaptive data structure that answers approximate nearest neighbor (ANN) queries to points that reside in a geometric space of any constant dimension...
CCCG
2008
13 years 6 months ago
2008
We present a novel approach to morph between two isometric poses of the same non-rigid object given as triangular meshes. We model the morphs as linear interpolations in a suitabl...
CCCG
2008
13 years 6 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
CCCG
2008
13 years 6 months ago
2008
We are interested in the following mesh refinement problem: given an input set of points P in Rd , we would like to produce a good-quality triangulation by adding new points in P....
CCCG
2008
13 years 6 months ago
2008
Let G be a graph embedded in the L1-plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio LG 1 (p, q)/L1(p, q), where LG 1 (p...