Sciweavers

CCCG
2010
14 years 2 months ago
Triangulations with many points of even degree
Let S be a set of points in the plane in general position. A triangulation of S will be called even if all the points of S have an even degree. We show how to construct a triangul...
Jorge Urrutia, Canek Peláez, Adriana Ram&ia...
CCCG
2010
14 years 2 months ago
Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
Xiuxia Pan, Fajie Li, Reinhard Klette
CCCG
2010
14 years 2 months ago
Stable roommates and geometric spanners
In this paper we devise a new geometric spanner based on a generalization of the known Stable Roommates algorithm. This spanner is on the "path" between the Yao graph an...
Paz Carmi, Lilach Chaitman
CCCG
2010
14 years 2 months ago
Complete enumeration of small realizable oriented matroids
Hiroyuki Miyata, Sonoko Moriyama, Komei Fukuda
CCCG
2010
14 years 2 months ago
Blocking delaunay triangulations
Given a set B of n blue points in general position, we say that a set of red points R blocks B if in the Delaunay triangulation of B R there is no edge connecting two blue points...
Oswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl,...
CCCG
2010
14 years 2 months ago
k-sets and continuous motion in R3
We prove several new results concerning k-sets of point sets on the 2-sphere (equivalently, for signed point sets in the plane) and k-sets in 3-space. Specific results include sph...
Marek Sulovský, Uli Wagner
CCCG
2010
14 years 2 months ago
On the variance of random polygons
A random polygon is the convex hull of uniformly distributed random points in a convex body K R2 . General upper bounds are established for the variance of the area of a random p...
William L. Steiger, Imre Bárány
CCCG
2010
14 years 2 months ago
Those ubiquitous cut polyhedra
I first met Paul Erd
David Avis
CCCG
2010
14 years 2 months ago
Constrained k-center and movement to independence
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising ...
Adrian Dumitrescu, Minghui Jiang
CCCG
2010
14 years 2 months ago
Computing straight skeletons of planar straight-line graphs based on motorcycle graphs
We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introd...
Stefan Huber, Martin Held