نتایج جستجو برای: irregular tessellation

تعداد نتایج: 33047  

2007
KAZUMINE INAGAKI AKIHIRO MATSUURA

In polyomino achievement games, two players alternately mark the cells of a tessellation and try to achieve a given polyomino. In [2], Bode and Harborth investigated polyomino achievement games for the hexagonal tessellation and determined all but five polyominoes with at most five cells whether they are achieved by the first player. In this paper, we show winning strategies for three hexagonal...

Journal: :Astronomy and Computing 2016

Journal: :Computer Graphics Forum 2009

Journal: :AIP Advances 2023

We present experimental observations of Faraday wave patterns when a liquid in square recipient is submitted to vertical vibrations with forcing frequencies and amplitudes the intervals 10 ≤ F 80 Hz 0.1 A 3 mm, respectively. sweep parameter space performed investigate surface that form for two different sizes recipient. The waveforms are obtained by means Pearson correlation analysis sequence i...

Journal: :Hiroshima Mathematical Journal 1995

Journal: :Monthly Notices of the Royal Astronomical Society 2010

2016
Hiroto Terasaki Takehiro Yamashita Naoya Yoshihara Yuya Kii Minoru Tanaka Kumiko Nakao Taiji Sakamoto

Tessellated fundus is found as common and early-phase characteristic of myopic eyes and their locations are varied among patients. However, the relationship between their locations and morphological parameters of the eyes is still unknown. The purpose is this study is to determine the locations of the tessellations in the ocular fundus of young healthy eyes, and to determine relationships betwe...

2012
Leila Hashemi Beni Mir Abolfazl Mostafavi Jacynthe Pouliot

Modelling and simulation of spatial processes is increasingly used for a wide variety of applications including water resources protection and management, meteorological prevision and forest fire monitoring. As an example, an accurate spatial modelling of a hydrological system can assist hydrologists to answer questions such as: "where does ground water come from?", “how does it travel through ...

Journal: :CoRR 2017
A. Abreu L. Cunha T. Fernandes C. de Figueiredo L. Kowada F. Marquezino D. Posner R. Portugal

A tessellation of a graph is a partition of its vertices into vertex disjoint cliques. A tessellation cover of a graph is a set of tessellations that covers all of its edges. The t-tessellability problem aims to decide whether there is a tessellation cover of the graph with t tessellations. This problem is motivated by its applications to quantum walk models, in especial, the evolution operator...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید