Join Our Newsletter

CCCG

2009

10 years 14 days ago
2009

We study the 1-center problem with outliers in highdimensional data streams. The problem definition is as follows: given a sequence of n points in d dimensions (with d arbitrarily...

CCCG

2009

10 years 14 days ago
2009

Motivated by the question of the polytopal realizability of the simplicial complex n,k of (k + 1)-crossing-free sets of diagonals of the convex n-gon, we study the first open case...

CCCG

2009

10 years 14 days ago
2009

We consider a special class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key with...

CCCG

2009

10 years 3 months ago
2009

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...

CCCG

2009

10 years 3 months ago
2009

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...

CCCG

2009

10 years 3 months ago
2009

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...

CCCG

2009

10 years 3 months ago
2009

CCCG

2009

10 years 3 months ago
2009

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...

CCCG

2009

10 years 3 months ago
2009

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...

CCCG

2009

10 years 3 months ago
2009

We study the emergence of rigid components in an Erdos-R