44 search results - page 5 / 9 » Dynamic Planar Convex Hull |
WADS
1997
Springer
13 years 11 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
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 ...
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...
CCCG
2009
13 years 8 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...
IPCO
2010
13 years 9 months ago
2010
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other p...