Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Petitjean, Sylvain"'
Autor:
Petitjean, Sylvain
Le monde physique dans lequel nous vivons est essentiellement géométrique. Le calcul géométrique est une brique centrale de nombreux domaines, comme la conception assistée par ordinateur, le graphisme, la robotique, la vision artificielle et bie
Externí odkaz:
http://tel.archives-ouvertes.fr/tel-00187348
http://tel.archives-ouvertes.fr/docs/00/18/73/48/PDF/hdr.pdf
http://tel.archives-ouvertes.fr/docs/00/18/73/48/PDF/hdr.pdf
Publikováno v:
Discrete and Computational Geometry (2006)
We prove Helly-type theorems for line transversals to disjoint unit balls in $\R^{d}$. In particular, we show that a family of $n \geq 2d$ disjoint unit balls in $\R^d$ has a line transversal if, for some ordering $\prec$ of the balls, any subfamily
Externí odkaz:
http://arxiv.org/abs/cs/0702039
We prove that the set of directions of lines intersecting three disjoint balls in $R^3$ in a given order is a strictly convex subset of $S^2$. We then generalize this result to $n$ disjoint balls in $R^d$. As a consequence, we can improve upon severa
Externí odkaz:
http://arxiv.org/abs/math/0612418
We study the variety of common tangents for up to four quadric surfaces in projective three-space, with particular regard to configurations of four quadrics admitting a continuum of common tangents. We formulate geometrical conditions in the projecti
Externí odkaz:
http://arxiv.org/abs/math/0402394
Publikováno v:
In Computational Geometry: Theory and Applications 2006 35(1):74-99
Autor:
Petitjean, Sylvain, Boyer, Edmond
Publikováno v:
In Computational Geometry: Theory and Applications 2001 19(2):101-126
Autor:
Petitjean, Sylvain
Publikováno v:
Joint international conferences : 9th Asian Symposium on Computer Mathematics (ASCM 2009) and 3rd International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS 2009)
Joint international conferences : 9th Asian Symposium on Computer Mathematics (ASCM 2009) and 3rd International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS 2009), Dec 2009, Fukuoka, Japan
Joint international conferences : 9th Asian Symposium on Computer Mathematics (ASCM 2009) and 3rd International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS 2009), Dec 2009, Fukuoka, Japan
International audience; We show how to efficiently detect the type of the intersection of two arbitrary plane conics. The characterization uses geometric predicates of bidegree $(6,6)$ in the two input conics. While we already proved similar results
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::159adc5dd8d2ac7cdbbc8fe03de662be
https://hal.inria.fr/inria-00431724
https://hal.inria.fr/inria-00431724
Autor:
Petitjean, Sylvain
Publikováno v:
Sylvain Petitjean. INRIA-LORIA, pp.270, 2008
International audience; The 24th European Workshop on Computational Geomety (EuroCG'08) was held at INRIA Nancy - Grand Est & LORIA on March 18-20, 2008. The present collection of abstracts contains the 63 scientific contributions as well as three in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f2ee74561e79a3123bf4858234f9a43c
https://inria.hal.science/inria-00595116/file/EuroCG08Abstracts.pdf
https://inria.hal.science/inria-00595116/file/EuroCG08Abstracts.pdf
Publikováno v:
EPRINTS-BOOK-TITLE
In this paper we show that the complexity, i.e., the number of elements, of a parabolic or conic spline approximating a sufficiently smooth curve with non-vanishing curvature to within Hausdorff distance ε is c1ε^−1/4 + O(1), or c2ε^−1/5 + O(1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::7dc8994c26e79e881f53670c6c6a4939
https://research.rug.nl/en/publications/dfddbfb3-ed38-4e45-a470-527b1e15f8dd
https://research.rug.nl/en/publications/dfddbfb3-ed38-4e45-a470-527b1e15f8dd
Publikováno v:
[Research Report] RR-5822, INRIA. 2006, pp.17
We study the expected size of the 2D visibility complex of randomly distributed objects in the plane. We prove that the expected asymptotic number of free bitangents (which correspond to the 0-faces of the visibility complex) among unit discs or poly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4a7a1795e96e77332774565afc069f99
https://hal.inria.fr/inria-00070203/document
https://hal.inria.fr/inria-00070203/document