Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CCCG
2010
10 years 2 months ago
Determining the robustness of sensor barriers
Various notions of coverage provided by wireless sensor networks have attracted considerable attention over the past few years. In general, coverage can be expressed geometrically...
David G. Kirkpatrick
CCCG
2010
10 years 4 months ago
Oja medians and centers of gravity
The relationships between the Oja median and centers of gravity are considered.
Dan Chen, Olivier Devillers, John Iacono, Stefan L...
CCCG
2010
10 years 4 months ago
Orthogonal thickness of graphs
Maryam Tahmasbi, S. Mehdi Hashemi
CCCG
2010
10 years 5 months ago
An optimal solution for dynamic polar diagram
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 ...
Ebrahim Ehsanfar, Bahram Sadeghi Bigham, Najmeh Ma...
CCCG
2010
10 years 5 months ago
I/O efficient path traversal in well-shaped tetrahedral meshes
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...
Craig Dillabaugh
CCCG
2010
10 years 5 months ago
Minimum enclosing area triangle with a fixed angle
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.
Prosenjit Bose, Jean-Lou De Carufel
CCCG
2010
10 years 5 months ago
Finding minimal bases in arbitrary spline spaces
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...
Ana Paula Malheiro, Jorge Stolfi
CCCG
2010
10 years 5 months ago
Towards a dynamic data structure for efficient bounded line range search
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...
Thuy Le, Bradford G. Nickerson
CCCG
2010
10 years 5 months ago
A new algorithm and improved lower bound for point placement on a line in two rounds
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]. ...
Md. Shafiul Alam, Asish Mukhopadhyay
books