Sciweavers

CCCG
2008
13 years 6 months ago
On a Cone Covering Problem
Given a set of polyhedral cones C1,
Khaled M. Elbassioni, Hans Raj Tiwary
CCCG
2008
13 years 6 months ago
On distinct distances among points in general position and other related problems
A set of points in the plane is said to be in general position if no three of them are collinear and no four of them are cocircular. If a point set determines only distinct vector...
Adrian Dumitrescu
CCCG
2008
13 years 6 months ago
Empty Monochromatic Triangles
We consider a variation of a problem stated by Erd
Oswin Aichholzer, Ruy Fabila Monroy, David Flores-...
CCCG
2008
13 years 6 months ago
Guaranteed Voronoi Diagrams of Uncertain Sites
In this paper we investigate the Voronoi diagram that is induced by a set of sites in the plane, where each site's precise location is uncertain but is known to be within a p...
Jeff Sember, William Evans
CCCG
2008
13 years 6 months ago
Draining a Polygon - or - Rolling a Ball out of a Polygon
We introduce the problem of draining water (or balls representing water drops) out of a punctured polygon (or a polyhedron) by rotating the shape. For 2D polygons, we obtain combi...
Greg Aloupis, Jean Cardinal, Sébastien Coll...
CCCG
2008
13 years 6 months ago
Competitive Search for Longest Empty Intervals
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
Peter Damaschke
CCCG
2008
13 years 6 months ago
Data Structures for Range-Aggregate Extent Queries
We consider a generalization of geometric range searching, with the goal of generating an informative "summary" of the objects contained in a query range via the applica...
Ravi Janardan, Prosenjit Gupta, Yokesh Kumar, Mich...
CCCG
2008
13 years 6 months ago
Maximal Covering by Two Isothetic Unit Squares
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of poin...
Priya Ranjan Sinha Mahapatra, Partha P. Goswami, S...
CCCG
2008
13 years 6 months ago
Triangulating and Guarding Realistic Polygons
We propose a new model of realistic input: k-guardable objects. An object is k-guardable if its boundary can be seen by k guards in the interior of the object. In this abstract, w...
Greg Aloupis, Prosenjit Bose, Vida Dujmovic, Chris...