<?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/20005">
        <ore:isDescribedBy rdf:resource="https://research-explorer.ista.ac.at/record/20005"/>
        <dc:title>On spheres with k points inside</dc:title>
        <bibo:authorList rdf:parseType="Collection">
            <foaf:Person>
                <foaf:name></foaf:name>
                <foaf:surname></foaf:surname>
                <foaf:givenname></foaf:givenname>
            </foaf:Person>
            <foaf:Person>
                <foaf:name></foaf:name>
                <foaf:surname></foaf:surname>
                <foaf:givenname></foaf:givenname>
            </foaf:Person>
            <foaf:Person>
                <foaf:name></foaf:name>
                <foaf:surname></foaf:surname>
                <foaf:givenname></foaf:givenname>
            </foaf:Person>
        </bibo:authorList>
        <bibo:abstract>We generalize a classical result by Boris Delaunay that introduced Delaunay triangulations. In particular, we prove that for a locally finite and coarsely dense generic point set A in ℝ^d, every generic point of ℝ^d belongs to exactly binom(d+k,d) simplices whose vertices belong to A and whose circumspheres enclose exactly k points of A. We extend this result to the cases in which the points are weighted, and when A contains only finitely many points in ℝ^d or in 𝕊^d. Furthermore, we use the result to give a new geometric proof for the fact that volumes of hypersimplices are Eulerian numbers.</bibo:abstract>
        <bibo:volume>332</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/20005/20016/2025_LIPIcs.SoCG_Edelsbrunner.pdf"/>
        <bibo:doi rdf:resource="10.4230/LIPIcs.SoCG.2025.43" />
        <ore:similarTo rdf:resource="info:doi/10.4230/LIPIcs.SoCG.2025.43"/>
    </rdf:Description>
</rdf:RDF>
