Sciweavers

141 search results - page 13 / 29
» dcg 2008
Sort
View
DCG
1999
110views more  DCG 1999»
13 years 7 months ago
Coloring Quasicrystals with Prescribed Symmetries and Frequencies
We show how to color the tiles in a heirarchical tiling system so that the resulting system is not only repetitive (i.e., has the local isomorphism property) but has prescribed col...
A. El Kacimi Alaoui, R. Parthasarathy
DCG
2006
97views more  DCG 2006»
13 years 7 months ago
k-Sets in Four Dimensions
We show, with an elementary proof, that the number of halving simplices in a set of n points in R4 in general position is O(n4-2/45). This improves the previous bound of O(n4-1/13...
Jirí Matousek, Micha Sharir, Shakhar Smorod...
DCG
2007
106views more  DCG 2007»
13 years 7 months ago
A Combinatorial Property of Points and Balls, a Colored Version
Any finite set X ⊂ Rd colored with d+3 2 colors, contains a rainbow subset Y ⊂ X, such that any ball that contains Y contains a positive fraction of the points of X. The bound...
Maria N. Prodromou
DCG
2010
101views more  DCG 2010»
13 years 6 months ago
Unknot Diagrams Requiring a Quadratic Number of Reidemeister Moves to Untangle
Given any knot diagram E, we present a sequence of knot diagrams of the same knot type, for which the minimum number of Reidemeister moves required to pass to E is quadratic with ...
Joel Hass, Tahl Nowik
DCG
2008
70views more  DCG 2008»
13 years 7 months ago
Decomposability of Polytopes
Abstract. We reformulate a known characterization of decomposability of polytopes in a way which may be more computationally convenient, and offer a more transparent proof. We appl...
Krzysztof Przeslawski, David Yost