Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
20
click to vote
ITA
2007
favorite
Email
discuss
report
85
views
Communications
»
more
ITA 2007
»
An algorithm for deciding if a polyomino tiles the plane
13 years 10 months ago
Download
www.lama.univ-savoie.fr
: For polyominoes coded by their boundary word, we describe a quadratic O(n2) algorithm in the boundary length n which improves the naive O(n4) algorithm. Techniques used emanate from algorithmics, discrete geometry and combinatorics on words.
Ian Gambini, Laurent Vuillon
Real-time Traffic
Algorithm
|
Boundary Length
|
Boundary Word
|
Communications
|
ITA 2007
|
claim paper
Related Content
»
Tiling the Plane with a Fixed Number of Polyominoes
»
Enumeration of Polyominoes for p4 Tiling
»
PolyominoBased Digital Halftoning
more »
Post Info
More Details (n/a)
Added
15 Dec 2010
Updated
15 Dec 2010
Type
Journal
Year
2007
Where
ITA
Authors
Ian Gambini, Laurent Vuillon
Comments
(0)
Researcher Info
Communications Study Group
Computer Vision