Sciweavers

CCCG
2010
13 years 11 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
13 years 11 months ago
Orthogonal thickness of graphs
Maryam Tahmasbi, S. Mehdi Hashemi
CCCG
2009
14 years 16 days ago
Every Large Point Set contains Many Collinear Points or an Empty Pentagon
We prove the following generalised empty pentagon theorem: for every integer 2, every sufficiently large set of points in the plane contains collinear points or an empty pentagon...
Zachary Abel, Brad Ballinger, Prosenjit Bose, S&ea...
CCCG
2009
14 years 16 days ago
On Directed Graphs with an Upward Straight-line
In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...
Carla Binucci, Emilio Di Giacomo, Walter Didimo, A...
CCCG
2009
14 years 16 days ago
Data Structures for Range Aggregation by Categories
We solve instances of a general class of problems defined as follows: Preprocess a set S of possibly weighted colored geometric objects (e.g. points/orthogonal segments/rectangles...
Saladi Rahul, Prosenjit Gupta, K. S. Rajan
CCCG
2009
14 years 16 days ago
How to make a picturesque maze
Yoshio Okamoto, Ryuhei Uehara
CCCG
2009
14 years 16 days ago
New Algorithms for Computing Maximum Perimeter and Maximum Area of the Convex Hull of Imprecise Inputs Based On the Parallel Lin
In this paper, we present new algorithms for computing maximum perimeter and maximum area of the convex hull of imprecise inputs based on the parallel line segment model. The runn...
Wenqi Ju, Jun Luo
CCCG
2009
14 years 16 days ago
Clarkson's Algorithm for Violator Spaces
Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs, but it can also be applied to the more general LP-type problems which comprise a number...
Yves Brise, Bernd Gärtner
CCCG
2009
14 years 16 days ago
Rigid Components of Random Graphs
We study the emergence of rigid components in an Erdos-R
Louis Theran