Minimum Strictly Convex Quadrangulations of Convex Polygons

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:43985f306378d132edd33c4485b2a851

MÜLLER-HANNEMANN, Matthias, Karsten WEIHE, 1996. Minimum Strictly Convex Quadrangulations of Convex Polygons

@unpublished{MullerHannemann1996Minim-6008, title={Minimum Strictly Convex Quadrangulations of Convex Polygons}, year={1996}, author={Müller-Hannemann, Matthias and Weihe, Karsten} }

<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/rdf/resource/123456789/6008"> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6008"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:43Z</dc:date> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103416863-3868037-7"/> <dcterms:abstract xml:lang="eng">We present a linear-time algorithm that decomposes a convex polygon conformally into a minimum number of strictly convex quadrilaterals. Moreover, we characterize the polygons that can be decomposed without additional vertices inside the polygon, and we present a linear-time algorithm for such decompositions, too. As an application, we consider the problem of constructing a minimum conformal refinement of a mesh in the three-dimensional space, which approximates the surface of a workpiece. The latter problem has resulted from a cooperation with an engineering company that sells CAD packages. We have proved that this problem is strongly NP-hard, and we present a linear-time algorithm with a constant approximation ratio of 4.</dcterms:abstract> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6008/1/preprint_013.pdf"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6008/1/preprint_013.pdf"/> <dc:creator>Müller-Hannemann, Matthias</dc:creator> <dc:contributor>Weihe, Karsten</dc:contributor> <dc:rights>deposit-license</dc:rights> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Müller-Hannemann, Matthias</dc:contributor> <dc:format>application/pdf</dc:format> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:43Z</dcterms:available> <dc:creator>Weihe, Karsten</dc:creator> <dc:language>eng</dc:language> <dcterms:title>Minimum Strictly Convex Quadrangulations of Convex Polygons</dcterms:title> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:issued>1996</dcterms:issued> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

preprint_013.pdf 131

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto