Serveur d'exploration sur la recherche en informatique en Lorraine

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Distance between Separating Circles and Points

Identifieur interne : 001F02 ( Istex/Curation ); précédent : 001F01; suivant : 001F03

Distance between Separating Circles and Points

Auteurs : Peter Veelaert [Belgique]

Source :

RBID : ISTEX:86F278545C2AB649CA17BABF9C1715825B7502CA

Abstract

Abstract: The family of separating circles of two finite sets S 1 and S 2 in the plane consists of all the circles that enclose S 1 but exclude S 2. We prove that the maximum and minimum distance between a point p and any separating circle in this family can be found by examining only a finite subset of circles, although the family itself is infinite. In addition, we introduce the concept of elementary circular separations to clarify some of the properties of separating circles.

Url:
DOI: 10.1007/978-3-642-19867-0_29

Links toward previous steps (curation, corpus...)


Links to Exploration step

ISTEX:86F278545C2AB649CA17BABF9C1715825B7502CA

Le document en format XML

<record>
<TEI wicri:istexFullTextTei="biblStruct">
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">Distance between Separating Circles and Points</title>
<author>
<name sortKey="Veelaert, Peter" sort="Veelaert, Peter" uniqKey="Veelaert P" first="Peter" last="Veelaert">Peter Veelaert</name>
<affiliation wicri:level="1">
<mods:affiliation>University College Ghent, Engineering Sciences - Ghent University Association, Schoonmeersstraat 52, B9000, Ghent, Belgium</mods:affiliation>
<country xml:lang="fr">Belgique</country>
<wicri:regionArea>University College Ghent, Engineering Sciences - Ghent University Association, Schoonmeersstraat 52, B9000, Ghent</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1">
<mods:affiliation>E-mail: Peter.Veelaert@hogent.be</mods:affiliation>
<country wicri:rule="url">Belgique</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:86F278545C2AB649CA17BABF9C1715825B7502CA</idno>
<date when="2011" year="2011">2011</date>
<idno type="doi">10.1007/978-3-642-19867-0_29</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-0H5CPTHT-S/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001F27</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001F27</idno>
<idno type="wicri:Area/Istex/Curation">001F02</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title level="a" type="main" xml:lang="en">Distance between Separating Circles and Points</title>
<author>
<name sortKey="Veelaert, Peter" sort="Veelaert, Peter" uniqKey="Veelaert P" first="Peter" last="Veelaert">Peter Veelaert</name>
<affiliation wicri:level="1">
<mods:affiliation>University College Ghent, Engineering Sciences - Ghent University Association, Schoonmeersstraat 52, B9000, Ghent, Belgium</mods:affiliation>
<country xml:lang="fr">Belgique</country>
<wicri:regionArea>University College Ghent, Engineering Sciences - Ghent University Association, Schoonmeersstraat 52, B9000, Ghent</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1">
<mods:affiliation>E-mail: Peter.Veelaert@hogent.be</mods:affiliation>
<country wicri:rule="url">Belgique</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series>
<title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass></textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">Abstract: The family of separating circles of two finite sets S 1 and S 2 in the plane consists of all the circles that enclose S 1 but exclude S 2. We prove that the maximum and minimum distance between a point p and any separating circle in this family can be found by examining only a finite subset of circles, although the family itself is infinite. In addition, we introduce the concept of elementary circular separations to clarify some of the properties of separating circles.</div>
</front>
</TEI>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001F02 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 001F02 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Istex
   |étape=   Curation
   |type=    RBID
   |clé=     ISTEX:86F278545C2AB649CA17BABF9C1715825B7502CA
   |texte=   Distance between Separating Circles and Points
}}

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022