| Identity statement area | |
| Reference Type | Conference Paper (Conference Proceedings) |
| Site | sibgrapi.sid.inpe.br |
| Identifier | 6qtX3pFwXQZeBBx/GHBVm |
| Repository | sid.inpe.br/banon/2005/07.10.17.42 |
| Last Update | 2005:07.10.03.00.00 administrator |
| Metadata | sid.inpe.br/banon/2005/07.10.17.42.13 |
| Metadata Last Update | 2020:02.19.03.19.10 administrator |
| Citation Key | AndradeNetoGued:2005:LiAlEx |
| Title | A linear algorithm for exact pattern matching in planar subdivisions  |
| Format | On-line |
| Year | 2005 |
| Date | 9-12 Oct. 2005 |
| Access Date | 2021, Jan. 19 |
| Number of Files | 1 |
| Size | 270 KiB |
| Context area | |
| Author | 1 Andrade Neto, Pedro Ribeiro de 2 Guedes, André Luiz Pires |
| Affiliation | 1 Federal University of Paraná |
| Editor | Rodrigues, Maria Andréia Formico Frery, Alejandro César |
| e-Mail Address | pedrorib@yahoo.com |
| Conference Name | Brazilian Symposium on Computer Graphics and Image Processing, 18 (SIBGRAPI) |
| Conference Location | Natal |
| Book Title | Proceedings |
| Publisher | IEEE Computer Society |
| Publisher City | Los Alamitos |
| Tertiary Type | Full Paper |
| History | 2005-07-10 17:42:13 :: pedrorib -> banon :: 2005-07-11 12:09:18 :: banon -> pedrorib :: 2008-07-17 14:10:59 :: pedrorib -> banon :: 2008-08-26 15:17:01 :: banon -> administrator :: 2009-08-13 20:37:46 :: administrator -> banon :: 2010-08-28 20:01:18 :: banon -> administrator :: 2020-02-19 03:19:10 :: administrator -> :: 2005 |
| Content and structure area | |
| Is the master or a copy? | is the master |
| Content Stage | completed |
| Transferable | 1 |
| Content Type | External Contribution |
| Keywords | sub-isomorphism, planar subdivisions. |
| Abstract | Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approximate solutions, or in special cases of the problem. Planar subdivisions can be considered as a special case of graphs, because, in addition to nodes and edges, there is a more rigid topology in relation to the order of the edges, arising to the concept of face. This work presents a linear algorithm for pattern search in planar subdivisions. The presented algorithm is based on a hybrid approach between the dual and the region adjacency graph (RAG) to represent the patterns, saving any additional storage cost. Thus, the patterns are looked over the search subdivision, using a region growing algorithm. |
| source Directory Content | there are no files |
| agreement Directory Content | there are no files |
| Conditions of access and use area | |
| data URL | http://urlib.net/rep/6qtX3pFwXQZeBBx/GHBVm |
| zipped data URL | http://urlib.net/zip/6qtX3pFwXQZeBBx/GHBVm |
| Language | en |
| Target File | andradep_matchsubdivisions.pdf |
| User Group | pedrorib administrator |
| Visibility | shown |
| Allied materials area | |
| Host Collection | sid.inpe.br/banon/2001/03.30.15.38 |
| Notes area | |
| Empty Fields | accessionnumber archivingpolicy archivist area callnumber copyholder copyright creatorhistory descriptionlevel dissemination documentstage doi edition electronicmailaddress group holdercode isbn issn label lineage mark mirrorrepository nextedition nexthigherunit notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url versiontype volume |