Publikation: Why CAD Data Repair Requires Discrete Techniques
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
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 consider a problem of reconstructing a discrete structure from unstructured numerical data. It arises in the computer-aided design of machines, motor vehicles, and other technical devices. A CAD model consists of a set of surface pieces in the three-dimensional space (the so-called mesh elements). The neighbourhoods of these mesh elements, the topology of the model, must be reconstructed. The reconstruction is non-trivial because of erroneous gaps between neighboured mesh elements.
However, a look at the real-world data from various applications strongly suggests that the pairs of neighboured mesh elements may be (nearly) correctly identified by some distance measure and some threshold. In fact, to our knowledge, this is the main strategy pursued in practice. In this paper, we make a first attempt to design systematic studies to support a negative claim: We demonstrate empirically that human intuition is misleading here, and that this approach fails miserably even for "innocent-looking" real-world data. In other words: It does not suffice to look at individual pairs of surface pieces separately; incorporating discrete relations between mesh elements is necessary.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
WEIHE, Karsten, Thomas WILLHALM, 1998. Why CAD Data Repair Requires Discrete TechniquesBibTex
@unpublished{Weihe1998Repai-5995, year={1998}, title={Why CAD Data Repair Requires Discrete Techniques}, author={Weihe, Karsten and Willhalm, Thomas} }
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/5995"> <dc:creator>Willhalm, Thomas</dc:creator> <dc:contributor>Willhalm, Thomas</dc:contributor> <dc:format>application/pdf</dc:format> <dc:contributor>Weihe, Karsten</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:39Z</dc:date> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5995"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:39Z</dcterms:available> <dcterms:issued>1998</dcterms:issued> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dcterms:abstract xml:lang="eng">We consider a problem of reconstructing a discrete structure from unstructured numerical data. It arises in the computer-aided design of machines, motor vehicles, and other technical devices. A CAD model consists of a set of surface pieces in the three-dimensional space (the so-called mesh elements). The neighbourhoods of these mesh elements, the topology of the model, must be reconstructed. The reconstruction is non-trivial because of erroneous gaps between neighboured mesh elements.<br /><br />However, a look at the real-world data from various applications strongly suggests that the pairs of neighboured mesh elements may be (nearly) correctly identified by some distance measure and some threshold. In fact, to our knowledge, this is the main strategy pursued in practice. In this paper, we make a first attempt to design systematic studies to support a negative claim: We demonstrate empirically that human intuition is misleading here, and that this approach fails miserably even for "innocent-looking" real-world data. In other words: It does not suffice to look at individual pairs of surface pieces separately; incorporating discrete relations between mesh elements is necessary.</dcterms:abstract> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:title>Why CAD Data Repair Requires Discrete Techniques</dcterms:title> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dc:language>eng</dc:language> <dc:creator>Weihe, Karsten</dc:creator> <dc:rights>terms-of-use</dc:rights> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5995/1/preprint_061.pdf"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5995/1/preprint_061.pdf"/> </rdf:Description> </rdf:RDF>