<?xml version="1.0" encoding="ISO-8859-1"?>
<metadatalist>
	<metadata ReferenceType="Conference Proceedings">
		<identifier>8JMKD3MGPBW34M/3EER9SH</identifier>
		<repository>sid.inpe.br/sibgrapi/2013/07.13.01.19</repository>
		<metadatarepository>sid.inpe.br/sibgrapi/2013/07.13.01.19.30</metadatarepository>
		<site>sibgrapi.sid.inpe.br 802</site>
		<citationkey>Gomez-NietoCasaNonaTaub:2013:MiInOp</citationkey>
		<author>Gomez-Nieto, Erick,</author>
		<author>Casaca, Wallace,</author>
		<author>Nonato, Luis Gustavo,</author>
		<author>Taubin, Gabriel,</author>
		<affiliation>San Pablo Catholic University</affiliation>
		<affiliation>ICMC, University of São Paulo (USP)</affiliation>
		<affiliation>ICMC, University of São Paulo (USP)</affiliation>
		<affiliation>School of Engineering, Brown University</affiliation>
		<title>Mixed Integer Optimization for Layout Arrangement</title>
		<conferencename>Conference on Graphics, Patterns and Images, 26 (SIBGRAPI)</conferencename>
		<year>2013</year>
		<editor>Boyer, Kim,</editor>
		<editor>Hirata, Nina,</editor>
		<editor>Nedel, Luciana,</editor>
		<editor>Silva, Claudio,</editor>
		<booktitle>Proceedings</booktitle>
		<date>Aug. 5-8, 2013</date>
		<publisheraddress>Los Alamitos</publisheraddress>
		<publisher>IEEE Computer Society</publisher>
		<conferencelocation>Arequipa, Peru</conferencelocation>
		<keywords>Overlap removal, Neighborhood preservation, Video snippet visualization, Optimization.</keywords>
		<abstract>Arranging geometric entities in a two-dimensional layout is a common task for most information visualization applications, where existing algorithms typically rely on heuristics to position shapes such as boxes or discs in a visual space. Geometric entities are used as a visual resource to convey information contained in data such as textual documents or videos and the challenge is to place objects with similar content close to each other while still avoiding overlap. In this work we present a novel mechanism to arrange rectangular boxes in a two-dimensional layout which copes with the two properties above, that is, it keeps similar object close and prevents overlap. In contrast to heuristic techniques, our approach relies on mixed integer quadratic programming, resulting in well structured arrangements which can easily be tuned to take different forms. We show the effectiveness of our methodology through a comprehensive set of comparisons against state-of-art methods. Moreover, we employ the proposed technique in video data visualization, attesting its usefulness in a practical application.</abstract>
		<language>en</language>
		<tertiarytype>Full Paper</tertiarytype>
		<format>On-line.</format>
		<size>4361 KiB</size>
		<numberoffiles>1</numberoffiles>
		<targetfile>MIOLA.pdf</targetfile>
		<lastupdate>2013:07.16.01.09.11 sid.inpe.br/banon/2001/03.30.15.38 wallace@icmc.usp.br</lastupdate>
		<metadatalastupdate>2020:02.19.03.09.22 sid.inpe.br/banon/2001/03.30.15.38 administrator {D 2013}</metadatalastupdate>
		<mirrorrepository>sid.inpe.br/banon/2001/03.30.15.38.24</mirrorrepository>
		<e-mailaddress>wallace@icmc.usp.br</e-mailaddress>
		<usergroup>wallace@icmc.usp.br</usergroup>
		<visibility>shown</visibility>
		<transferableflag>1</transferableflag>
		<hostcollection>sid.inpe.br/banon/2001/03.30.15.38</hostcollection>
		<contenttype>External Contribution</contenttype>
		<agreement>agreement.html .htaccess .htaccess2</agreement>
		<lasthostcollection>sid.inpe.br/banon/2001/03.30.15.38</lasthostcollection>
		<url>http://sibgrapi.sid.inpe.br/rep-/sid.inpe.br/sibgrapi/2013/07.13.01.19</url>
	</metadata>
</metadatalist>