| 1. Identity statement | |
| Reference Type | Conference Paper (Conference Proceedings) |
| Site | sibgrapi.sid.inpe.br |
| Holder Code | ibi 8JMKD3MGPEW34M/46T9EHH |
| Identifier | 6qtX3pFwXQZeBBx/GHBVm |
| Repository | sid.inpe.br/banon/2005/07.10.17.42 |
| Last Update | 2005:07.10.03.00.00 (UTC) administrator |
| Metadata Repository | sid.inpe.br/banon/2005/07.10.17.42.13 |
| Metadata Last Update | 2022:06.14.00.12.56 (UTC) administrator |
| DOI | 10.1109/SIBGRAPI.2005.5 |
| Citation Key | AndradeNetoGued:2005:LiAlEx |
| Title | A linear algorithm for exact pattern matching in planar subdivisions  |
| Format | On-line |
| Year | 2005 |
| Access Date | 2024, Apr. 19 |
| Number of Files | 1 |
| Size | 270 KiB |
| 2. Context | |
| 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, RN, Brazil |
| Date | 9-12 Oct. 2005 |
| Publisher | IEEE Computer Society |
| Publisher City | Los Alamitos |
| Book Title | Proceedings |
| Tertiary Type | Full Paper |
| History (UTC) | 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 :: 2022-06-14 00:12:56 :: administrator -> :: 2005 |
| 3. Content and structure | |
| Is the master or a copy? | is the master |
| Content Stage | completed |
| Transferable | 1 |
| Version Type | finaldraft |
| 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. |
| Arrangement 1 | urlib.net > SDLA > Fonds > SIBGRAPI 2005 > A linear algorithm... |
| Arrangement 2 | urlib.net > SDLA > Fonds > Full Index > A linear algorithm... |
| doc Directory Content | access |
| source Directory Content | there are no files |
| agreement Directory Content | there are no files |
| 4. Conditions of access and use | |
| data URL | http://urlib.net/ibi/6qtX3pFwXQZeBBx/GHBVm |
| zipped data URL | http://urlib.net/zip/6qtX3pFwXQZeBBx/GHBVm |
| Language | en |
| Target File | andradep_matchsubdivisions.pdf |
| User Group | pedrorib administrator |
| Visibility | shown |
| 5. Allied materials | |
| Next Higher Units | 8JMKD3MGPEW34M/46R3ED5 8JMKD3MGPEW34M/4742MCS |
| Citing Item List | sid.inpe.br/sibgrapi/2022/05.05.04.08 5 sid.inpe.br/banon/2001/03.30.15.38.24 2 |
| Host Collection | sid.inpe.br/banon/2001/03.30.15.38 |
| 6. Notes | |
| Empty Fields | archivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage edition electronicmailaddress group isbn issn label lineage mark mirrorrepository 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 volume |