Close
Metadata

Identity statement area
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Identifier6qtX3pFwXQZeBBx/GHBVm
Repositorysid.inpe.br/banon/2005/07.10.17.42
Last Update2005:07.10.03.00.00 administrator
Metadatasid.inpe.br/banon/2005/07.10.17.42.13
Metadata Last Update2020:02.19.03.19.10 administrator
Citation KeyAndradeNetoGued:2005:LiAlEx
TitleA linear algorithm for exact pattern matching in planar subdivisions
FormatOn-line
Year2005
Date9-12 Oct. 2005
Access Date2021, Jan. 19
Number of Files1
Size270 KiB
Context area
Author1 Andrade Neto, Pedro Ribeiro de
2 Guedes, André Luiz Pires
Affiliation1 Federal University of Paraná
EditorRodrigues, Maria Andréia Formico
Frery, Alejandro César
e-Mail Addresspedrorib@yahoo.com
Conference NameBrazilian Symposium on Computer Graphics and Image Processing, 18 (SIBGRAPI)
Conference LocationNatal
Book TitleProceedings
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Tertiary TypeFull Paper
History2005-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 Stagecompleted
Transferable1
Content TypeExternal Contribution
Keywordssub-isomorphism, planar subdivisions.
AbstractGraph 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 Contentthere are no files
agreement Directory Contentthere are no files
Conditions of access and use area
data URLhttp://urlib.net/rep/6qtX3pFwXQZeBBx/GHBVm
zipped data URLhttp://urlib.net/zip/6qtX3pFwXQZeBBx/GHBVm
Languageen
Target Fileandradep_matchsubdivisions.pdf
User Grouppedrorib
administrator
Visibilityshown
Allied materials area
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
Notes area
Empty Fieldsaccessionnumber 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

Close