Weighted linde-buzo-gray stippling

Deussen, Oliver; Spicker, Marc; Zheng, Qian

Weighted linde-buzo-gray stippling

Dateien

Deussen_2-gu29mv4u87jh2.pdfGröße: 2.1 MBDownloads: 1862

Datum

2017

Publikationstyp

Zeitschriftenartikel

Publikationsstatus

Published

Erschienen in

ACM Transactions on Graphics. 2017, 36(6), 233. ISSN 0730-0301. eISSN 1557-7368. Available under: doi: 10.1145/3130800.3130819

Zusammenfassung

We propose an adaptive version of Lloyd's optimization method that distributes points based on Voronoi diagrams. Our inspiration is the Linde-Buzo-Gray-Algorithm in vector quantization, which dynamically splits Voronoi cells until a desired number of representative vectors is reached. We reformulate this algorithm by splitting and merging Voronoi cells based on their size, greyscale level, or variance of an underlying input image. The proposed method automatically adapts to various constraints and, in contrast to previous work, requires no good initial point distribution or prior knowledge about the final number of points. Compared to weighted Voronoi stippling the convergence rate is much higher and the spectral and spatial properties are superior. Further, because points are created based on local operations, coherent stipple animations can be produced. Our method is also able to produce good quality point sets in other fields, such as remeshing of geometry, based on local geometric features such as curvature.

Fachgebiet (DDC)

004 Informatik

Schlagwörter

Lloyd optimization, Voronoi Diagram, Linde–Buzo–Gray-Algorithm, Stippling, Sampling, Remeshing

Zitieren

ISO 690

DEUSSEN, Oliver, Marc SPICKER, Qian ZHENG, 2017. Weighted linde-buzo-gray stippling. In: ACM Transactions on Graphics. 2017, 36(6), 233. ISSN 0730-0301. eISSN 1557-7368. Available under: doi: 10.1145/3130800.3130819

BibTex

@article{Deussen2017-11-20Weigh-41075,
  year={2017},
  doi={10.1145/3130800.3130819},
  title={Weighted linde-buzo-gray stippling},
  number={6},
  volume={36},
  issn={0730-0301},
  journal={ACM Transactions on Graphics},
  author={Deussen, Oliver and Spicker, Marc and Zheng, Qian},
  note={Article Number: 233}
}

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/41075">
    <dcterms:title>Weighted linde-buzo-gray stippling</dcterms:title>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:issued>2017-11-20</dcterms:issued>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/41075"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Deussen, Oliver</dc:creator>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:abstract xml:lang="eng">We propose an adaptive version of Lloyd's optimization method that distributes points based on Voronoi diagrams. Our inspiration is the Linde-Buzo-Gray-Algorithm in vector quantization, which dynamically splits Voronoi cells until a desired number of representative vectors is reached. We reformulate this algorithm by splitting and merging Voronoi cells based on their size, greyscale level, or variance of an underlying input image. The proposed method automatically adapts to various constraints and, in contrast to previous work, requires no good initial point distribution or prior knowledge about the final number of points. Compared to weighted Voronoi stippling the convergence rate is much higher and the spectral and spatial properties are superior. Further, because points are created based on local operations, coherent stipple animations can be produced. Our method is also able to produce good quality point sets in other fields, such as remeshing of geometry, based on local geometric features such as curvature.</dcterms:abstract>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/41075/1/Deussen_2-gu29mv4u87jh2.pdf"/>
    <dc:contributor>Spicker, Marc</dc:contributor>
    <dc:creator>Spicker, Marc</dc:creator>
    <dc:contributor>Zheng, Qian</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-01-16T14:29:49Z</dcterms:available>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/41075/1/Deussen_2-gu29mv4u87jh2.pdf"/>
    <dc:rights>terms-of-use</dc:rights>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:language>eng</dc:language>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Zheng, Qian</dc:creator>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-01-16T14:29:49Z</dc:date>
    <dc:contributor>Deussen, Oliver</dc:contributor>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja