Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Pocchiola, Michel"'
Autor:
Habert, Luc, Pocchiola, Michel
Publikováno v:
Discrete Comput. Geom. 48(3):518-579, 2012
We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility complexes and o
Externí odkaz:
http://arxiv.org/abs/1102.0151
Autor:
Habert, Luc, Pocchiola, Michel
Publikováno v:
Discrete Comput. Geom., 50 (3): 552-648, 2013
We extend the classical LR characterization of chirotopes of finite planar families of points to chirotopes of finite planar families of pairwise disjoint convex bodies: a map \c{hi} on the set of 3-subsets of a finite set I is a chirotope of finite
Externí odkaz:
http://arxiv.org/abs/1101.1022
Autor:
Pilaud, Vincent, Pocchiola, Michel
Publikováno v:
Discrete Comput. Geom., 48(1):142-191, 2012
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a natural notion of flip between these arrangements and study the graph of these flips. In particular, we provide an enumeration algorithm for
Externí odkaz:
http://arxiv.org/abs/1009.5344
Publikováno v:
Discrete Comput. Geom., 45(2):279-302, 2011
We describe an incremental algorithm to enumerate the isomorphism classes of double pseudoline arrangements. The correction of our algorithm is based on the connectedness under mutations of the spaces of one-extensions of double pseudoline arrangemen
Externí odkaz:
http://arxiv.org/abs/1009.1575
Publikováno v:
In Computational Geometry: Theory and Applications 2003 26(1):81-97
Autor:
Pilaud, Vincent, Pocchiola, Michel
Publikováno v:
25th European Workshop on Computational Geometry (EuroCG 2009)
25th European Workshop on Computational Geometry (EuroCG 2009), Mar 2009, Bruxelles, Belgium
25th European Workshop on Computational Geometry (EuroCG 2009), Mar 2009, Bruxelles, Belgium
International audience; We introduce a natural generalization of both pseudotriangulations and multitriangulations, that we call multi-pseudotriangulations. We propose an enumeration algorithm for multi-pseudotriangulations, based on certain greedy m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::b45d3bf4b53b43eab7509596c860beb3
https://hal.archives-ouvertes.fr/hal-00778499
https://hal.archives-ouvertes.fr/hal-00778499
Autor:
Habert, Luc, Pocchiola, Michel
Publikováno v:
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
instname
We show that the convex hull of a collection of n pairwise disjoint disks in the plane is computable in O(n log n) time using only the chirotope of the collection of disks. The method relies mainly on the development of an (elementary) theory of conv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4283986677cc7631036c806b64e68ae8
https://idus.us.es/handle/11441/55098
https://idus.us.es/handle/11441/55098
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Berstel, Jean, Pocchiola, Michel
Publikováno v:
Le Courrier du C.N.R.S., la recherche en informatique
Gagnepain Jean-Jacques. Le Courrier du C.N.R.S., la recherche en informatique, 80, La recherche en informatique, pp.58-59, 1992
Gagnepain Jean-Jacques. Le Courrier du C.N.R.S., la recherche en informatique, 80, La recherche en informatique, pp.58-59, 1992
incollection
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::9ec74aaf2964f8fa06faf88845d5b484
https://hal.archives-ouvertes.fr/hal-00620849
https://hal.archives-ouvertes.fr/hal-00620849
Publikováno v:
McGraw Hill France, 257pp., 1991
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::08f04c54326a4b36ba1f9c826c112b74
https://hal.science/hal-00619790
https://hal.science/hal-00619790