Procedural Interpolation of Historical City Maps

We propose a novel approach for the temporal interpolation of city maps. The input to our algorithm is a sparse set of historical city maps plus optional additional knowledge about construction or destruction events. The output is a fast forward animation of the city map development where roads and...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer graphics forum 2012-05, Vol.31 (2pt3), p.691-700
Hauptverfasser: Krecklau, Lars, Manthei, Christopher, Kobbelt, Leif
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 700
container_issue 2pt3
container_start_page 691
container_title Computer graphics forum
container_volume 31
creator Krecklau, Lars
Manthei, Christopher
Kobbelt, Leif
description We propose a novel approach for the temporal interpolation of city maps. The input to our algorithm is a sparse set of historical city maps plus optional additional knowledge about construction or destruction events. The output is a fast forward animation of the city map development where roads and buildings are constructed and destroyed over time in order to match the sparse historical facts and to look plausible where no precise facts are available. A smooth transition between any real‐world data could be interesting for educational purposes, because our system conveys an intuition of the city development. The insertion of data, like when and where a certain building or road existed, is efficiently performed by an intuitive graphical user interface. Our system collects all this information into a global dependency graph of events. By propagating time intervals through the dependency graph we can automatically derive the earliest and latest possible date for each event which are guaranteeing temporal as well as geographical consistency (e.g. buildings can only appear along roads that have been constructed before). During the simulation of the city development, events are scheduled according to a score function that rates the plausibility of the development (e.g. cities grow along major roads). Finally, the events are properly distributed over time to control the dynamics of the city development. Based on the city map animation we create a procedural city model in order to render a 3D animation of the city development over decades.
doi_str_mv 10.1111/j.1467-8659.2012.03048.x
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1018863714</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2680076421</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3598-f2012d3d31e69bf557927fb3242caff003e3eb726ae658dbb0e317f148607aed3</originalsourceid><addsrcrecordid>eNqNkMtOwzAQRS0EEqXwD5FYJ9hx_MiCBQT6kFooqIil5SS2lBDqYKci_XscgrpmNh5p7hmPDgABghHydVNHKKEs5JSkUQxRHEEMEx71J2ByHJyCCUS-Z5CQc3DhXA0hTBglEwA31hSq3FvZBMtdp2xrGtlVZhcYHSwq1xlbFX6WVd0hWMvWXYIzLRunrv7eKXibPW6zRbh6ni-zu1VYYJLyUA-3lLjESNE014SwNGY6x3ESF1JrCLHCKmcxlYoSXuY5VBgxjRJOIZOqxFNwPe5trfnaK9eJ2uztzn8pEEScU8xQ4lN8TBXWOGeVFq2tPqU9-JAY_IhaDBrEoEEMN4lfP6L36O2IfleNOvybE9l8NnSeD0feS1L9kZf2Q1CGGRHvT3OxWT8k29cXLO7xD9oJeYo</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1018863714</pqid></control><display><type>article</type><title>Procedural Interpolation of Historical City Maps</title><source>Wiley Journals</source><source>EBSCOhost Business Source Complete</source><creator>Krecklau, Lars ; Manthei, Christopher ; Kobbelt, Leif</creator><creatorcontrib>Krecklau, Lars ; Manthei, Christopher ; Kobbelt, Leif</creatorcontrib><description>We propose a novel approach for the temporal interpolation of city maps. The input to our algorithm is a sparse set of historical city maps plus optional additional knowledge about construction or destruction events. The output is a fast forward animation of the city map development where roads and buildings are constructed and destroyed over time in order to match the sparse historical facts and to look plausible where no precise facts are available. A smooth transition between any real‐world data could be interesting for educational purposes, because our system conveys an intuition of the city development. The insertion of data, like when and where a certain building or road existed, is efficiently performed by an intuitive graphical user interface. Our system collects all this information into a global dependency graph of events. By propagating time intervals through the dependency graph we can automatically derive the earliest and latest possible date for each event which are guaranteeing temporal as well as geographical consistency (e.g. buildings can only appear along roads that have been constructed before). During the simulation of the city development, events are scheduled according to a score function that rates the plausibility of the development (e.g. cities grow along major roads). Finally, the events are properly distributed over time to control the dynamics of the city development. Based on the city map animation we create a procedural city model in order to render a 3D animation of the city development over decades.</description><identifier>ISSN: 0167-7055</identifier><identifier>EISSN: 1467-8659</identifier><identifier>DOI: 10.1111/j.1467-8659.2012.03048.x</identifier><language>eng</language><publisher>Oxford, UK: Blackwell Publishing Ltd</publisher><subject>Algorithms ; Animation ; Computer graphics ; Computer science ; I.3.4 [Computer Graphics]: Graphics Utilities-Paint Systems ; I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism-Animation ; Information management ; Studies</subject><ispartof>Computer graphics forum, 2012-05, Vol.31 (2pt3), p.691-700</ispartof><rights>2012 The Author(s) Computer Graphics Forum © 2012 The Eurographics Association and Blackwell Publishing Ltd.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3598-f2012d3d31e69bf557927fb3242caff003e3eb726ae658dbb0e317f148607aed3</citedby><cites>FETCH-LOGICAL-c3598-f2012d3d31e69bf557927fb3242caff003e3eb726ae658dbb0e317f148607aed3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1111%2Fj.1467-8659.2012.03048.x$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1111%2Fj.1467-8659.2012.03048.x$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,780,784,1417,27924,27925,45574,45575</link.rule.ids></links><search><creatorcontrib>Krecklau, Lars</creatorcontrib><creatorcontrib>Manthei, Christopher</creatorcontrib><creatorcontrib>Kobbelt, Leif</creatorcontrib><title>Procedural Interpolation of Historical City Maps</title><title>Computer graphics forum</title><description>We propose a novel approach for the temporal interpolation of city maps. The input to our algorithm is a sparse set of historical city maps plus optional additional knowledge about construction or destruction events. The output is a fast forward animation of the city map development where roads and buildings are constructed and destroyed over time in order to match the sparse historical facts and to look plausible where no precise facts are available. A smooth transition between any real‐world data could be interesting for educational purposes, because our system conveys an intuition of the city development. The insertion of data, like when and where a certain building or road existed, is efficiently performed by an intuitive graphical user interface. Our system collects all this information into a global dependency graph of events. By propagating time intervals through the dependency graph we can automatically derive the earliest and latest possible date for each event which are guaranteeing temporal as well as geographical consistency (e.g. buildings can only appear along roads that have been constructed before). During the simulation of the city development, events are scheduled according to a score function that rates the plausibility of the development (e.g. cities grow along major roads). Finally, the events are properly distributed over time to control the dynamics of the city development. Based on the city map animation we create a procedural city model in order to render a 3D animation of the city development over decades.</description><subject>Algorithms</subject><subject>Animation</subject><subject>Computer graphics</subject><subject>Computer science</subject><subject>I.3.4 [Computer Graphics]: Graphics Utilities-Paint Systems</subject><subject>I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism-Animation</subject><subject>Information management</subject><subject>Studies</subject><issn>0167-7055</issn><issn>1467-8659</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNqNkMtOwzAQRS0EEqXwD5FYJ9hx_MiCBQT6kFooqIil5SS2lBDqYKci_XscgrpmNh5p7hmPDgABghHydVNHKKEs5JSkUQxRHEEMEx71J2ByHJyCCUS-Z5CQc3DhXA0hTBglEwA31hSq3FvZBMtdp2xrGtlVZhcYHSwq1xlbFX6WVd0hWMvWXYIzLRunrv7eKXibPW6zRbh6ni-zu1VYYJLyUA-3lLjESNE014SwNGY6x3ESF1JrCLHCKmcxlYoSXuY5VBgxjRJOIZOqxFNwPe5trfnaK9eJ2uztzn8pEEScU8xQ4lN8TBXWOGeVFq2tPqU9-JAY_IhaDBrEoEEMN4lfP6L36O2IfleNOvybE9l8NnSeD0feS1L9kZf2Q1CGGRHvT3OxWT8k29cXLO7xD9oJeYo</recordid><startdate>201205</startdate><enddate>201205</enddate><creator>Krecklau, Lars</creator><creator>Manthei, Christopher</creator><creator>Kobbelt, Leif</creator><general>Blackwell Publishing Ltd</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>201205</creationdate><title>Procedural Interpolation of Historical City Maps</title><author>Krecklau, Lars ; Manthei, Christopher ; Kobbelt, Leif</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3598-f2012d3d31e69bf557927fb3242caff003e3eb726ae658dbb0e317f148607aed3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Algorithms</topic><topic>Animation</topic><topic>Computer graphics</topic><topic>Computer science</topic><topic>I.3.4 [Computer Graphics]: Graphics Utilities-Paint Systems</topic><topic>I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism-Animation</topic><topic>Information management</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Krecklau, Lars</creatorcontrib><creatorcontrib>Manthei, Christopher</creatorcontrib><creatorcontrib>Kobbelt, Leif</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computer graphics forum</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Krecklau, Lars</au><au>Manthei, Christopher</au><au>Kobbelt, Leif</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Procedural Interpolation of Historical City Maps</atitle><jtitle>Computer graphics forum</jtitle><date>2012-05</date><risdate>2012</risdate><volume>31</volume><issue>2pt3</issue><spage>691</spage><epage>700</epage><pages>691-700</pages><issn>0167-7055</issn><eissn>1467-8659</eissn><abstract>We propose a novel approach for the temporal interpolation of city maps. The input to our algorithm is a sparse set of historical city maps plus optional additional knowledge about construction or destruction events. The output is a fast forward animation of the city map development where roads and buildings are constructed and destroyed over time in order to match the sparse historical facts and to look plausible where no precise facts are available. A smooth transition between any real‐world data could be interesting for educational purposes, because our system conveys an intuition of the city development. The insertion of data, like when and where a certain building or road existed, is efficiently performed by an intuitive graphical user interface. Our system collects all this information into a global dependency graph of events. By propagating time intervals through the dependency graph we can automatically derive the earliest and latest possible date for each event which are guaranteeing temporal as well as geographical consistency (e.g. buildings can only appear along roads that have been constructed before). During the simulation of the city development, events are scheduled according to a score function that rates the plausibility of the development (e.g. cities grow along major roads). Finally, the events are properly distributed over time to control the dynamics of the city development. Based on the city map animation we create a procedural city model in order to render a 3D animation of the city development over decades.</abstract><cop>Oxford, UK</cop><pub>Blackwell Publishing Ltd</pub><doi>10.1111/j.1467-8659.2012.03048.x</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0167-7055
ispartof Computer graphics forum, 2012-05, Vol.31 (2pt3), p.691-700
issn 0167-7055
1467-8659
language eng
recordid cdi_proquest_journals_1018863714
source Wiley Journals; EBSCOhost Business Source Complete
subjects Algorithms
Animation
Computer graphics
Computer science
I.3.4 [Computer Graphics]: Graphics Utilities-Paint Systems
I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism-Animation
Information management
Studies
title Procedural Interpolation of Historical City Maps
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-30T20%3A42%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Procedural%20Interpolation%20of%20Historical%20City%20Maps&rft.jtitle=Computer%20graphics%20forum&rft.au=Krecklau,%20Lars&rft.date=2012-05&rft.volume=31&rft.issue=2pt3&rft.spage=691&rft.epage=700&rft.pages=691-700&rft.issn=0167-7055&rft.eissn=1467-8659&rft_id=info:doi/10.1111/j.1467-8659.2012.03048.x&rft_dat=%3Cproquest_cross%3E2680076421%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1018863714&rft_id=info:pmid/&rfr_iscdi=true