Inverse Procedural Modelling of Trees

Lade...
Vorschaubild
Dateien
Stava_278149.pdf
Stava_278149.pdfGröße: 1.28 MBDownloads: 1411
Datum
2014
Autor:innen
Stava, Ondrej
Chen, Baoquan
Mech, Radomir
Benes, Bedrich
Herausgeber:innen
Kontakt
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
ArXiv-ID
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Gesperrt bis
Titel in einer weiteren Sprache
Forschungsvorhaben
Organisationseinheiten
Zeitschriftenheft
Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published
Erschienen in
Computer Graphics Forum. 2014, 33(6), pp. 118-131. ISSN 0167-7055. eISSN 1467-8659. Available under: doi: 10.1111/cgf.12282
Zusammenfassung

Procedural tree models have been popular in computer graphics for their ability to generate a variety of output trees from a set of input parameters and to simulate plant interaction with the environment for a realistic placement of trees in virtual scenes. However, defining such models and their parameters is a difficult task. We propose an inverse modelling approach for stochastic trees that takes polygonal tree models as input and estimates the parameters of a procedural model so that it produces trees similar to the input. Our framework is based on a novel parametric model for tree generation and uses Monte Carlo Markov Chains to find the optimal set of parameters. We demonstrate our approach on a variety of input models obtained from different sources, such as interactive modelling systems, reconstructed scans of real trees and developmental models.

Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690STAVA, Ondrej, Sören PIRK, Julian KRATT, Baoquan CHEN, Radomir MECH, Oliver DEUSSEN, Bedrich BENES, 2014. Inverse Procedural Modelling of Trees. In: Computer Graphics Forum. 2014, 33(6), pp. 118-131. ISSN 0167-7055. eISSN 1467-8659. Available under: doi: 10.1111/cgf.12282
BibTex
@article{Stava2014Inver-27814,
  year={2014},
  doi={10.1111/cgf.12282},
  title={Inverse Procedural Modelling of Trees},
  number={6},
  volume={33},
  issn={0167-7055},
  journal={Computer Graphics Forum},
  pages={118--131},
  author={Stava, Ondrej and Pirk, Sören and Kratt, Julian and Chen, Baoquan and Mech, Radomir and Deussen, Oliver and Benes, Bedrich}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/27814">
    <dcterms:abstract xml:lang="eng">Procedural tree models have been popular in computer graphics for their ability to generate a variety of output trees from a set of input parameters and to simulate plant interaction with the environment for a realistic placement of trees in virtual scenes. However, defining such models and their parameters is a difficult task. We propose an inverse modelling approach for stochastic trees that takes polygonal tree models as input and estimates the parameters of a procedural model so that it produces trees similar to the input. Our framework is based on a novel parametric model for tree generation and uses Monte Carlo Markov Chains to find the optimal set of parameters. We demonstrate our approach on a variety of input models obtained from different sources, such as interactive modelling systems, reconstructed scans of real trees and developmental models.</dcterms:abstract>
    <dc:rights>terms-of-use</dc:rights>
    <dc:contributor>Deussen, Oliver</dc:contributor>
    <dcterms:issued>2014</dcterms:issued>
    <dc:contributor>Stava, Ondrej</dc:contributor>
    <dc:contributor>Chen, Baoquan</dc:contributor>
    <dc:creator>Benes, Bedrich</dc:creator>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Mech, Radomir</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2014-05-22T12:15:26Z</dcterms:available>
    <dc:creator>Chen, Baoquan</dc:creator>
    <dc:contributor>Benes, Bedrich</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/27814/2/Stava_278149.pdf"/>
    <dc:creator>Stava, Ondrej</dc:creator>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2014-05-22T12:15:26Z</dc:date>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:creator>Mech, Radomir</dc:creator>
    <dc:contributor>Kratt, Julian</dc:contributor>
    <dc:creator>Deussen, Oliver</dc:creator>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/27814/2/Stava_278149.pdf"/>
    <dc:creator>Kratt, Julian</dc:creator>
    <dcterms:title>Inverse Procedural Modelling of Trees</dcterms:title>
    <dc:creator>Pirk, Sören</dc:creator>
    <dc:contributor>Pirk, Sören</dc:contributor>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/27814"/>
    <dc:language>eng</dc:language>
  </rdf:Description>
</rdf:RDF>
Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Kontakt
URL der Originalveröffentl.
Prüfdatum der URL
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Diese Publikation teilen