CCCG
2007
13 years 10 months ago
2007
CCCG
2010
13 years 10 months ago
2010
The Polar Diagram [1] of a set of points (i.e. sites) is a partition of the plane. It is a locus approach for problems processing angles. Also, Dynamic Polar Diagram problem is a ...
CCCG
2010
13 years 10 months ago
2010
We present a data structure which represents a wellshaped convex tetrahedral mesh, M, in linear space such that path traversals visiting a sequence of K tetrahedra require O (K/ l...
CCCG
2010
13 years 10 months ago
2010
Given a set S of n points in the plane and a fixed angle 0 < < , we show how to find all triangles of minimum area with angle that enclose S in O(n log n) time.
CCCG
2010
13 years 10 months ago
2010
In this work we describe a general algorithm to find a finite-element basis with minimum total support for an arbitrary spline space, given any basis for that same space. The runn...
CCCG
2010
13 years 10 months ago
2010
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
CCCG
2010
13 years 10 months ago
2010
In this paper we show how to construct in 2 rounds a line-rigid point placement graph of size 4n/3+O(1) from small graphs called 6:6 jewels, an extension of the 4:4 jewel of [3]. ...
CCCG
2010
13 years 10 months ago
2010
A set of n colored objects (points/hyperboxes) lie in IRd . Each object has a weight associated with it. Given a query orthogonal range q, for each distinct color c of the objects...
CCCG
2010
13 years 10 months ago
2010
In 1994 Gr
CCCG
2010
13 years 10 months ago
2010
In this paper, we initiate the study of small strong nets and prove bounds for axis-parallel rectangles, half spaces, strips and wedges. We also give some improved bounds for smal...