164 search results - page 7 / 33 » Adaptive Algorithms for Planar Convex Hull Problems |
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
We solve several fundamental geometric problems under a new streaming model recently proposed by Ruhl et al. [2, 12]. In this model, in one pass the input stream can be scanned to ...
CCCG
2006
13 years 9 months ago
2006
We consider the problem of removing c points from a set S of n points so that the resulting point set has the smallest possible convex hull. Our main result is an O n 4c 2c (3c)c +...
ISAAC
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We consider all planar oriented curves that have the following property depending on a fixed angle . For each point B on the curve, the rest of the curve lies inside a we...
DCG
2010
13 years 7 months ago
2010
Given any > 0 and any planar region bounded by a simple n-gon P we construct a (1 + )-quasiconformal map between and the unit disk in time C()n. One can take C() = C + C log ...
ALENEX
2007
13 years 9 months ago
2007
In polyhedral studies of 0/1 polytopes two prominent problems exist. One is the vertex enumeration problem: Given a system of inequalities, enumerate its feasible 0/1 points. Anot...