Close
Metadata

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier8JMKD3MGPAW/3PJ9JSH
Repositorysid.inpe.br/sibgrapi/2017/09.05.18.25
Last Update2017:09.05.18.47.08 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi/2017/09.05.18.25.29
Metadata Last Update2022:05.18.22.18.24 (UTC) administrator
Citation KeyYamadaBata:2017:CoStCo
TitleA comparative study on computational methods to solve tangram puzzles
FormatOn-line
Year2017
Access Date2024, Oct. 08
Number of Files1
Size295 KiB
2. Context
Author1 Yamada, Fernanda Miyuki
2 Batagelo, Harlen Costa
Affiliation1 Federal University of ABC
2 Federal University of ABC
EditorTorchelsen, Rafael Piccin
Nascimento, Erickson Rangel do
Panozzo, Daniele
Liu, Zicheng
Farias, Mylène
Viera, Thales
Sacht, Leonardo
Ferreira, Nivan
Comba, João Luiz Dihl
Hirata, Nina
Schiavon Porto, Marcelo
Vital, Creto
Pagot, Christian Azambuja
Petronetto, Fabiano
Clua, Esteban
Cardeal, Flávio
e-Mail Addressfernandamyamada1@gmail.com
Conference NameConference on Graphics, Patterns and Images, 30 (SIBGRAPI)
Conference LocationNiterói, RJ, Brazil
Date17-20 Oct. 2017
PublisherSociedade Brasileira de Computação
Publisher CityPorto Alegre
Book TitleProceedings
Tertiary TypeWork in Progress
History (UTC)2017-09-05 18:47:08 :: fernandamyamada1@gmail.com -> administrator :: 2017
2022-05-18 22:18:24 :: administrator -> :: 2017
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Keywordstangram
geometric puzzle
comparative study
heuristic programming
AbstractThe tangram is a dissection puzzle composed of seven polygonal pieces which can be combined to form different patterns. Besides being a recreational puzzle, the tangram relates to a more general class of combinatorial NP-hard problems such as the bin packing problem and jigsaw puzzles. In this paper, we propose a comparative study of current computational methods for automatically solving tangram puzzles. In particular, we propose to implement and compare four approaches that employ strategies based on computational heuristics, genetic algorithms, artificial neural networks and algebraic representations. We intend to identify their similarities, their strengths and weaknesses in order to better understand the tangram puzzle problem, ultimately leading to an improved computational method for solving dissection puzzles.
Arrangementurlib.net > SDLA > Fonds > SIBGRAPI 2017 > A comparative study...
doc Directory Contentaccess
source Directory Content
comparative-study-computational.pdf 05/09/2017 15:25 295.0 KiB 
agreement Directory Content
agreement.html 05/09/2017 15:25 1.2 KiB 
4. Conditions of access and use
data URLhttp://urlib.net/ibi/8JMKD3MGPAW/3PJ9JSH
zipped data URLhttp://urlib.net/zip/8JMKD3MGPAW/3PJ9JSH
Languageen
Target Filecomparative-study-computational.pdf
User Groupfernandamyamada1@gmail.com
Visibilityshown
Update Permissionnot transferred
5. Allied materials
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Next Higher Units8JMKD3MGPAW/3PKCC58
Citing Item Listsid.inpe.br/sibgrapi/2017/09.12.13.04 37
sid.inpe.br/banon/2001/03.30.15.38.24 3
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination doi edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url versiontype volume


Close