Close

1. Identity statement
Reference TypeJournal Article
Sitemtc-m16.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Repositorysid.inpe.br/mtc-m16@80/2006/06.28.18.26   (restricted access)
Last Update2006:06.28.18.26.56 (UTC) administrator
Metadata Repositorysid.inpe.br/mtc-m16@80/2006/06.28.18.26.57
Metadata Last Update2018:06.05.01.16.51 (UTC) administrator
Secondary KeyINPE--PRE/
ISSN0098-3004
Citation KeyRibeiroLore:2006:HeCaLa
TitleHeuristics for cartographic label placement problems
Year2006
MonthJuly
Access Date2024, Apr. 27
Secondary TypePRE PI
Number of Files1
Size215 KiB
2. Context
Author1 Ribeiro, Glaydston Mattos
2 Lorena, Luiz Antonio Nogueira
Resume Identifier1
2 8JMKD3MGP5W/3C9JHMQ
Group1 LAC-INPE-MCT-BR
2 LAC-INPE-MCT-BR
Affiliation1 Instituto Nacional de Pesquisas Espaciais, Laboratório Associado de Computação e Matemática Aplicada (INPE.LAC)
2 Instituto Nacional de Pesquisas Espaciais, Laboratório Associado de Computação e Matemática Aplicada (INPE.LAC)
JournalComputers and Geosciences
Volume32
Number6
Pages739-748
History (UTC)2006-08-03 13:09:39 :: simone -> administrator ::
2011-06-03 15:41:56 :: administrator -> simone ::
2011-10-31 12:05:31 :: simone -> administrator :: 2006
2018-06-05 01:16:51 :: administrator -> marciana :: 2006
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
Version Typepublisher
KeywordsLabel placement
Modeling
Lagrangean relaxation
Lagrangean/Surrogate relaxation
Heuristic
AbstractThe cartographic label placement problem is an important task in automated cartography and Geographical Information Systems. Positioning the texts requires that overlap among texts should be avoided, that cartographic conventions and preference should be obeyed. This paper examines the point-feature cartographic label placement problem (PFCLP) as an optimization problem. We formulate the PFCLP considering the minimization of existing overlaps and labeling of all points on a map. This objective improves legibility when all points must be placed even if overlaps are inevitable. A new mathematical formulation of binary integer linear programming that allows labeling of all points is presented, followed by some Lagrangean relaxation heuristics. The computational tests considered instances proposed in the literature up to 1000 points, and the relaxations provided good lower and upper bounds.
AreaCOMP
Arrangementurlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > Heuristics for cartographic...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
Target FileHeuristics for cartographic label.pdf
User Groupadministrator
simone
Visibilityshown
Archiving Policydenypublisher denyfinaldraft24
Read Permissiondeny from all and allow from 150.163
Update Permissionnot transferred
5. Allied materials
Next Higher Units8JMKD3MGPCW/3ESGTTP
DisseminationWEBSCI; PORTALCAPES; MGA; COMPENDEX.
Host Collectionsid.inpe.br/banon/2003/08.15.17.40
6. Notes
Empty Fieldsalternatejournal archivist callnumber copyholder copyright creatorhistory descriptionlevel doi e-mailaddress electronicmailaddress format identifier isbn label language lineage mark mirrorrepository nextedition notes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup rightsholder schedulinginformation secondarydate secondarymark session shorttitle sponsor subject tertiarymark tertiarytype typeofwork url
7. Description control
e-Mail (login)marciana
update 


Close