<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
         xmlns:dc="http://purl.org/dc/terms/"
         xmlns:foaf="http://xmlns.com/foaf/0.1/"
         xmlns:bibo="http://purl.org/ontology/bibo/"
         xmlns:fabio="http://purl.org/spar/fabio/"
         xmlns:owl="http://www.w3.org/2002/07/owl#"
         xmlns:event="http://purl.org/NET/c4dm/event.owl#"
         xmlns:ore="http://www.openarchives.org/ore/terms/">

    <rdf:Description rdf:about="https://research-explorer.ista.ac.at/record/22000">
        <ore:isDescribedBy rdf:resource="https://research-explorer.ista.ac.at/record/22000"/>
        <dc:title>Simplicial approximation to CW complexes with spherical Delaunay triangulations</dc:title>
        <bibo:authorList rdf:parseType="Collection">
            <foaf:Person>
                <foaf:name></foaf:name>
                <foaf:surname></foaf:surname>
                <foaf:givenname></foaf:givenname>
            </foaf:Person>
        </bibo:authorList>
        <bibo:abstract>Simplicial approximation provides a framework for constructing simplicial complexes that are homotopy equivalent to a given manifold, provided a CW structure is explicitly known. However, its conventional implementation quickly becomes intractable on a computer: barycentric subdivision produces poorly shaped simplices, and the star condition introduces many vertices. To address these limitations, this article develops a subdivision scheme based on spherical Delaunay triangulations, which attains better refinement properties than barycentric subdivisions. Moreover, the star condition is reframed as two independent problems, one geometric and the other combinatorial, respectively tackled in the language of locally equiconnected spaces and the list homomorphism problem, allowing an exponential reduction in the number of vertices. Via a prototype implementation, we obtain simplicial complexes homotopy equivalent to Grassmannians and Stiefel manifolds up to dimension 5.</bibo:abstract>
        <bibo:volume>367</bibo:volume>
        <dc:publisher>Schloss Dagstuhl - Leibniz-Zentrum für Informatik</dc:publisher>
        <dc:format>application/pdf</dc:format>
        <ore:aggregates rdf:resource="https://research-explorer.ista.ac.at/download/22000/22111/2026_LIPIcSSoCG_Tinarrage.pdf"/>
        <bibo:doi rdf:resource="10.4230/LIPIcs.SoCG.2026.93" />
        <ore:similarTo rdf:resource="info:doi/10.4230/LIPIcs.SoCG.2026.93"/>
    </rdf:Description>
</rdf:RDF>
