Merge
Accueil
Racine
Merge
Exploration
Accueil
Racine
Accueil
Racine

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.

Disjoint Unit Spheres Admit At Most Two Line Transversals

Identifieur interne : 007C27 ( Main/Merge ); précédent : 007C26; suivant : 007C28

Disjoint Unit Spheres Admit At Most Two Line Transversals

Auteurs : Otfried Cheong ; Xavier Goaoc ; Hyeon-Suk Na

Source :

RBID : CRIN:cheong03a

English descriptors

Abstract

We show that a set of n disjoint unit spheres in \mathbb{R}^d admits at most two distinct geometric permutations, or line transversals, if n is large enough. This bound is optimal.

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

Links to Exploration step

CRIN:cheong03a

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" wicri:score="129">Disjoint Unit Spheres Admit At Most Two Line Transversals</title>
</titleStmt>
<publicationStmt>
<idno type="RBID">CRIN:cheong03a</idno>
<date when="2003" year="2003">2003</date>
<idno type="wicri:Area/Crin/Corpus">003811</idno>
<idno type="wicri:Area/Crin/Curation">003811</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003811</idno>
<idno type="wicri:Area/Crin/Checkpoint">000D80</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">000D80</idno>
<idno type="wicri:Area/Main/Merge">007C27</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">Disjoint Unit Spheres Admit At Most Two Line Transversals</title>
<author>
<name sortKey="Cheong, Otfried" sort="Cheong, Otfried" uniqKey="Cheong O" first="Otfried" last="Cheong">Otfried Cheong</name>
</author>
<author>
<name sortKey="Goaoc, Xavier" sort="Goaoc, Xavier" uniqKey="Goaoc X" first="Xavier" last="Goaoc">Xavier Goaoc</name>
</author>
<author>
<name sortKey="Na, Hyeon Suk" sort="Na, Hyeon Suk" uniqKey="Na H" first="Hyeon-Suk" last="Na">Hyeon-Suk Na</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>computational geometry</term>
<term>geometric permutation</term>
<term>transversal</term>
<term>unit sphere</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en" wicri:score="567">We show that a set of n disjoint unit spheres in \mathbb{R}^d admits at most two distinct geometric permutations, or line transversals, if n is large enough. This bound is optimal.</div>
</front>
</TEI>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 007C27 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 007C27 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Merge
   |type=    RBID
   |clé=     CRIN:cheong03a
   |texte=   Disjoint Unit Spheres Admit At Most Two Line Transversals
}}
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