Zobrazeno 1 - 10
of 67
pro vyhledávání: '"Goaoc, X."'
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.
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:
Goaoc, X., Kratochvil, J., Okamoto, Y., Shin, C.S., Wolff, A., Hong, S.K., Nishizeki, T., Quan, W.
Publikováno v:
15th International Symposium on Graph Drawing
15th International Symposium on Graph Drawing, Sep 2007, Sydney, Australia. pp.101-112, ⟨10.1007/978-3-540-77537-9_13⟩
ResearcherID
Graph Drawing (15th International Symposium, GD'07, Sydney, Australia, September 23-26, 2007, Revised Papers), 101-112
STARTPAGE=101;ENDPAGE=112;TITLE=Graph Drawing (15th International Symposium, GD'07, Sydney, Australia, September 23-26, 2007, Revised Papers)
Graph Drawing ISBN: 9783540775362
Graph Drawing
15th International Symposium on Graph Drawing, Sep 2007, Sydney, Australia. pp.101-112, ⟨10.1007/978-3-540-77537-9_13⟩
ResearcherID
Graph Drawing (15th International Symposium, GD'07, Sydney, Australia, September 23-26, 2007, Revised Papers), 101-112
STARTPAGE=101;ENDPAGE=112;TITLE=Graph Drawing (15th International Symposium, GD'07, Sydney, Australia, September 23-26, 2007, Revised Papers)
Graph Drawing ISBN: 9783540775362
Graph Drawing
A straight-line drawing $\delta$ of a planar graph $G$ need not be plane, but can be made so by moving some of the vertices. Let shift$(G,\delta)$ denote the minimum number of vertices that need to be moved to turn $\delta$ into a plane drawing of $G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::941e151e661442f28fd8a6d8c0dae33f
https://doi.org/10.1007/978-3-540-77537-9_13
https://doi.org/10.1007/978-3-540-77537-9_13
Conference
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.
Publikováno v:
19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08)
19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08), 2008, San Francisco, United States. pp.1249--1256
Scopus-Elsevier
19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08), 2008, San Francisco, United States. pp.1249--1256
Scopus-Elsevier
International audience; We define and study a geometric graph over points in the plane that captures the local behavior of Delaunay triangulations of points on smooth surfaces in 3-space. Two points in a planar point set P are neighbors in the empty-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::dbe080749b21c8f056d4aee335e0745a
https://inria.hal.science/inria-00176204/document
https://inria.hal.science/inria-00176204/document
Publikováno v:
Proceedings of Robotics: Science and Systems (Cambridge MA, USA, June 8-11, 2005), Online, 1-7
STARTPAGE=1;ENDPAGE=7;TITLE=Proceedings of Robotics: Science and Systems (Cambridge MA, USA, June 8-11, 2005)
STARTPAGE=1;ENDPAGE=7;TITLE=Proceedings of Robotics: Science and Systems (Cambridge MA, USA, June 8-11, 2005)
We consider the efficient computation of sequences of push actions that simultaneously orient two different polygons. Our motivation for studying this problem comes from the observation that appropriately oriented parts admit simple sensorless sortin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::f5a94c0892c21554fdf6af40d469289f
https://research.tue.nl/nl/publications/fb38dcdb-f145-4df2-8931-ba14012c45a7
https://research.tue.nl/nl/publications/fb38dcdb-f145-4df2-8931-ba14012c45a7
Publikováno v:
Proceedings 21st Annual ACM Symposium on Computational Geometry (Pisa, Italy, June 6-8, 2005), 10-15
STARTPAGE=10;ENDPAGE=15;TITLE=Proceedings 21st Annual ACM Symposium on Computational Geometry (Pisa, Italy, June 6-8, 2005)
STARTPAGE=10;ENDPAGE=15;TITLE=Proceedings 21st Annual ACM Symposium on Computational Geometry (Pisa, Italy, June 6-8, 2005)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::71196f4ede8b61e011b2aba11f2aa61c
https://research.tue.nl/nl/publications/5e6e71bf-ee71-4321-a189-ae5f4a82f662
https://research.tue.nl/nl/publications/5e6e71bf-ee71-4321-a189-ae5f4a82f662
Publikováno v:
Algorithms-ESA 2003 ISBN: 9783540200642
ESA
Algorithms-ESA 2003 (Proceedings 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003), 127-135
STARTPAGE=127;ENDPAGE=135;TITLE=Algorithms-ESA 2003 (Proceedings 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003)
11th Annual European Symposium on Algorithms-ESA 2003
11th Annual European Symposium on Algorithms-ESA 2003, Sep 2003, Budapest, Hungary. pp.127-135, ⟨10.1007/b13632⟩
[Research Report] RR-4854, INRIA. 2003
ESA
Algorithms-ESA 2003 (Proceedings 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003), 127-135
STARTPAGE=127;ENDPAGE=135;TITLE=Algorithms-ESA 2003 (Proceedings 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003)
11th Annual European Symposium on Algorithms-ESA 2003
11th Annual European Symposium on Algorithms-ESA 2003, Sep 2003, Budapest, Hungary. pp.127-135, ⟨10.1007/b13632⟩
[Research Report] RR-4854, INRIA. 2003
http://www.springerlink.com; International audience; We show that a set of $n$~disjoint unit spheres in $\Rd$ admits at most \emph{two} distinct geometric permutations, or line transversals, if $n$ is large enough. This bound is optimal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ede2222a6fe225451dd786ea635664f
https://doi.org/10.1007/978-3-540-39658-1_14
https://doi.org/10.1007/978-3-540-39658-1_14
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.
Publikováno v:
2010 IEEE Conference on Computer Vision & Pattern Recognition (CVPR); 2010, p1578-1585, 8p