Sciweavers

52 search results - page 7 / 11
» dcg 2010
Sort
View
DCG
2010
76views more  DCG 2010»
13 years 7 months ago
Tiling Polygons with Lattice Triangles
Given a simple polygon with rational coordinates having one vertex at the origin and an adjacent vertex on the x-axis, we look at the problem of the location of the vertices for a...
Steve Butler, Fan R. K. Chung, Ronald L. Graham, M...
DCG
2010
121views more  DCG 2010»
13 years 4 months ago
Compression Schemes, Stable Definable Families, and o-Minimal Structures
We show that any family of sets uniformly definable in an ominimal structure has an extended compression scheme of size equal to the number of parameters in the defining formula. ...
H. R. Johnson, M. C. Laskowski
DCG
2010
87views more  DCG 2010»
13 years 7 months ago
Hamiltonian Submanifolds of Regular Polytopes
: We investigate polyhedral 2k-manifolds as subcomplexes of the boundary complex of a regular polytope. We call such a subcomplex k-Hamiltonian if it contains the full k-skeleton o...
Felix Effenberger, Wolfgang Kühnel
DCG
2010
67views more  DCG 2010»
13 years 7 months ago
Conformal Mapping in Linear Time
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 ...
Christopher J. Bishop
DCG
2010
137views more  DCG 2010»
13 years 7 months ago
Improved Results on Geometric Hitting Set Problems
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray