Publikation: A Simple Push-Pull Algorithm for Blue-Noise Sampling
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
We describe a simple push-pull optimization (PPO) algorithm for blue-noise sampling by enforcing spatial constraints on given point sets. Constraints can be a minimum distance between samples, a maximum distance between an arbitrary point and the nearest sample, and a maximum deviation of a sample's capacity (area of Voronoi cell) from the mean capacity. All of these constraints are based on the topology emerging from Delaunay triangulation, and they can be combined for improved sampling quality and efficiency. In addition, our algorithm offers flexibility for trading-off between different targets, such as noise and aliasing. We present several applications of the proposed algorithm, including anti-aliasing, stippling, and nonobtuse remeshing. Our experimental results illustrate the efficiency and the robustness of the proposed approach. Moreover, we demonstrate that our remeshing quality is superior to the current state-of-the-art approaches.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
AHMED, Abdalla G.M., Jianwei GUO, Dong-Ming YAN, Jean-Yves FRANCESCHI, Xiaopeng ZHANG, Oliver DEUSSEN, 2016. A Simple Push-Pull Algorithm for Blue-Noise Sampling. In: IEEE Transactions on Visualization and Computer Graphics. 2016, PP(99), pp. 1. ISSN 1077-2626. eISSN 1941-0506. Available under: doi: 10.1109/TVCG.2016.2641963BibTex
@article{Ahmed2016Simpl-38119, year={2016}, doi={10.1109/TVCG.2016.2641963}, title={A Simple Push-Pull Algorithm for Blue-Noise Sampling}, number={99}, volume={PP}, issn={1077-2626}, journal={IEEE Transactions on Visualization and Computer Graphics}, author={Ahmed, Abdalla G.M. and Guo, Jianwei and Yan, Dong-Ming and Franceschi, Jean-Yves and Zhang, Xiaopeng and Deussen, Oliver} }
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/38119"> <dc:creator>Ahmed, Abdalla G.M.</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-03-23T10:04:52Z</dcterms:available> <dcterms:title>A Simple Push-Pull Algorithm for Blue-Noise Sampling</dcterms:title> <dc:creator>Zhang, Xiaopeng</dc:creator> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/38119"/> <dc:contributor>Guo, Jianwei</dc:contributor> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:creator>Deussen, Oliver</dc:creator> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:creator>Guo, Jianwei</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dc:contributor>Ahmed, Abdalla G.M.</dc:contributor> <dcterms:abstract xml:lang="eng">We describe a simple push-pull optimization (PPO) algorithm for blue-noise sampling by enforcing spatial constraints on given point sets. Constraints can be a minimum distance between samples, a maximum distance between an arbitrary point and the nearest sample, and a maximum deviation of a sample's capacity (area of Voronoi cell) from the mean capacity. All of these constraints are based on the topology emerging from Delaunay triangulation, and they can be combined for improved sampling quality and efficiency. In addition, our algorithm offers flexibility for trading-off between different targets, such as noise and aliasing. We present several applications of the proposed algorithm, including anti-aliasing, stippling, and nonobtuse remeshing. Our experimental results illustrate the efficiency and the robustness of the proposed approach. Moreover, we demonstrate that our remeshing quality is superior to the current state-of-the-art approaches.</dcterms:abstract> <dcterms:issued>2016</dcterms:issued> <dc:contributor>Yan, Dong-Ming</dc:contributor> <dc:creator>Yan, Dong-Ming</dc:creator> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-03-23T10:04:52Z</dc:date> <dc:contributor>Zhang, Xiaopeng</dc:contributor> <dc:contributor>Franceschi, Jean-Yves</dc:contributor> <dc:creator>Franceschi, Jean-Yves</dc:creator> <dc:contributor>Deussen, Oliver</dc:contributor> <dc:language>eng</dc:language> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> </rdf:Description> </rdf:RDF>