17 search results - page 4 / 4 » Convex Hull of Planar H-Polyhedra |
DCG
2010
13 years 5 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 ...
CCCG
2009
13 years 6 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...